%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN356^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Oct 7 11:05:36 AM UTC 2026
% Result : Theorem 0.07s 0.22s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 54 ( 35 unt; 0 typ; 0 def)
% Number of atoms : 267 ( 70 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 379 ( 58 ~; 42 |; 16 &; 248 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 0 ^; 84 !; 0 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cA,type,
cA: $i ).
thf(tp_cB,type,
cB: $i ).
thf(tp_cQ,type,
cQ: $i > $i > $o ).
thf(tp_cR,type,
cR: $i > $i > $o ).
thf(1,conjecture,
( ( ( cR @ cA @ cB )
& ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) )
& ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
=> ( ( cQ @ cA @ cA )
& ( cQ @ cB @ cB ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cLX2107) ).
thf(2,negated_conjecture,
( ( ( ( cR @ cA @ cB )
& ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) )
& ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
=> ( ( cQ @ cA @ cA )
& ( cQ @ cB @ cB ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ( cR @ cA @ cB )
& ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) )
& ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
=> ( ( cQ @ cA @ cA )
& ( cQ @ cB @ cB ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( cR @ cA @ cB )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ( cQ @ cA @ cA )
& ( cQ @ cB @ cB ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( cQ @ cA @ cA )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[7]) ).
thf(9,plain,
( ( cQ @ cB @ cB )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[7]) ).
thf(10,plain,
( ( ~ ( cQ @ cA @ cA ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( cQ @ cB @ cB ) )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(12,plain,
( ( ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(13,plain,
( ( ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(14,plain,
( ( cR @ cA @ cB )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(15,plain,
( ( ~ ( cQ @ cA @ cA ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( ~ ( cR @ SX1 @ SX0 )
| ~ ( cQ @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(17,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( cQ @ SX0 @ SX1 )
| ( cQ @ SX0 @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(18,plain,
( ( cQ @ cA @ cA )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(19,plain,
! [SV1: $i] :
( ( ! [SY4: $i] :
( ~ ( cR @ SV1 @ SY4 )
| ~ ( ~ ( cR @ SY4 @ SV1 )
| ~ ( cQ @ SV1 @ SY4 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(20,plain,
! [SV2: $i] :
( ( ! [SY5: $i] :
( ~ ( cQ @ SV2 @ SY5 )
| ( cQ @ SV2 @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(21,plain,
! [SV3: $i,SV1: $i] :
( ( ~ ( cR @ SV1 @ SV3 )
| ~ ( ~ ( cR @ SV3 @ SV1 )
| ~ ( cQ @ SV1 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV4: $i,SV2: $i] :
( ( ~ ( cQ @ SV2 @ SV4 )
| ( cQ @ SV2 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( cR @ SV1 @ SV3 ) )
= $true )
| ( ( ~ ( ~ ( cR @ SV3 @ SV1 )
| ~ ( cQ @ SV1 @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV4: $i,SV2: $i] :
( ( ( ~ ( cQ @ SV2 @ SV4 ) )
= $true )
| ( ( cQ @ SV2 @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[22]) ).
thf(25,plain,
! [SV3: $i,SV1: $i] :
( ( ( cR @ SV1 @ SV3 )
= $false )
| ( ( ~ ( ~ ( cR @ SV3 @ SV1 )
| ~ ( cQ @ SV1 @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV4: $i,SV2: $i] :
( ( ( cQ @ SV2 @ SV4 )
= $false )
| ( ( cQ @ SV2 @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(27,plain,
! [SV1: $i,SV3: $i] :
( ( ( ~ ( cR @ SV3 @ SV1 )
| ~ ( cQ @ SV1 @ SV3 ) )
= $false )
| ( ( cR @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(28,plain,
! [SV1: $i,SV3: $i] :
( ( ( ~ ( cR @ SV3 @ SV1 ) )
= $false )
| ( ( cR @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(29,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( cQ @ SV1 @ SV3 ) )
= $false )
| ( ( cR @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[27]) ).
thf(30,plain,
! [SV1: $i,SV3: $i] :
( ( ( cR @ SV3 @ SV1 )
= $true )
| ( ( cR @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(31,plain,
! [SV3: $i,SV1: $i] :
( ( ( cQ @ SV1 @ SV3 )
= $true )
| ( ( cR @ SV1 @ SV3 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(32,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,31,30,26,18]) ).
thf(33,plain,
( ( ! [U: $i,V: $i] :
( ( cQ @ U @ V )
=> ( cQ @ U @ U ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(34,plain,
( ( ! [X: $i,Y: $i] :
( ( cR @ X @ Y )
=> ( ( cR @ Y @ X )
& ( cQ @ X @ Y ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(35,plain,
( ( cR @ cA @ cB )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(36,plain,
( ( ~ ( cQ @ cB @ cB ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(37,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( cQ @ SX0 @ SX1 )
| ( cQ @ SX0 @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[33]) ).
thf(38,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( cR @ SX0 @ SX1 )
| ~ ( ~ ( cR @ SX1 @ SX0 )
| ~ ( cQ @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[34]) ).
thf(39,plain,
( ( cQ @ cB @ cB )
= $false ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(40,plain,
! [SV5: $i] :
( ( ! [SY6: $i] :
( ~ ( cQ @ SV5 @ SY6 )
| ( cQ @ SV5 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(41,plain,
! [SV6: $i] :
( ( ! [SY7: $i] :
( ~ ( cR @ SV6 @ SY7 )
| ~ ( ~ ( cR @ SY7 @ SV6 )
| ~ ( cQ @ SV6 @ SY7 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[38]) ).
thf(42,plain,
! [SV7: $i,SV5: $i] :
( ( ~ ( cQ @ SV5 @ SV7 )
| ( cQ @ SV5 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[40]) ).
thf(43,plain,
! [SV8: $i,SV6: $i] :
( ( ~ ( cR @ SV6 @ SV8 )
| ~ ( ~ ( cR @ SV8 @ SV6 )
| ~ ( cQ @ SV6 @ SV8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(44,plain,
! [SV7: $i,SV5: $i] :
( ( ( ~ ( cQ @ SV5 @ SV7 ) )
= $true )
| ( ( cQ @ SV5 @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[42]) ).
thf(45,plain,
! [SV8: $i,SV6: $i] :
( ( ( ~ ( cR @ SV6 @ SV8 ) )
= $true )
| ( ( ~ ( ~ ( cR @ SV8 @ SV6 )
| ~ ( cQ @ SV6 @ SV8 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[43]) ).
thf(46,plain,
! [SV7: $i,SV5: $i] :
( ( ( cQ @ SV5 @ SV7 )
= $false )
| ( ( cQ @ SV5 @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[44]) ).
thf(47,plain,
! [SV8: $i,SV6: $i] :
( ( ( cR @ SV6 @ SV8 )
= $false )
| ( ( ~ ( ~ ( cR @ SV8 @ SV6 )
| ~ ( cQ @ SV6 @ SV8 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[45]) ).
thf(48,plain,
! [SV6: $i,SV8: $i] :
( ( ( ~ ( cR @ SV8 @ SV6 )
| ~ ( cQ @ SV6 @ SV8 ) )
= $false )
| ( ( cR @ SV6 @ SV8 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[47]) ).
thf(49,plain,
! [SV6: $i,SV8: $i] :
( ( ( ~ ( cR @ SV8 @ SV6 ) )
= $false )
| ( ( cR @ SV6 @ SV8 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(50,plain,
! [SV8: $i,SV6: $i] :
( ( ( ~ ( cQ @ SV6 @ SV8 ) )
= $false )
| ( ( cR @ SV6 @ SV8 )
= $false ) ),
inference(extcnf_or_neg,[status(thm)],[48]) ).
thf(51,plain,
! [SV6: $i,SV8: $i] :
( ( ( cR @ SV8 @ SV6 )
= $true )
| ( ( cR @ SV6 @ SV8 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[49]) ).
thf(52,plain,
! [SV8: $i,SV6: $i] :
( ( ( cQ @ SV6 @ SV8 )
= $true )
| ( ( cR @ SV6 @ SV8 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[50]) ).
thf(53,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[35,52,51,46,39]) ).
thf(54,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[53,32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN356^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.18 % Computer : n018.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Oct 6 17:21:40 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.22
% 0.07/0.22 No.of.Axioms: 0
% 0.07/0.22
% 0.07/0.22 Length.of.Defs: 0
% 0.07/0.22
% 0.07/0.22 Contains.Choice.Funs: false
% 0.07/0.22 .
% 0.07/0.22
% 0.07/0.22 ********************************
% 0.07/0.22 * All subproblems solved! *
% 0.07/0.22 ********************************
% 0.07/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:53,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.22
% 0.07/0.22 %**** Beginning of derivation protocol ****
% 0.07/0.22 % SZS output start CNFRefutation
% See solution above
% 0.07/0.22
% 0.07/0.22 %**** End of derivation protocol ****
% 0.07/0.22 %**** no. of clauses in derivation: 54 ****
% 0.07/0.22 %**** clause counter: 53 ****
% 0.07/0.22
% 0.07/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:3,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:53,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------