%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.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 : n026.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:07:25 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 25 unt; 0 typ; 2 def)
% Number of atoms : 119 ( 74 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 89 ( 10 ~; 10 |; 0 &; 51 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 32 ^; 29 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_leibeq1,type,
leibeq1: $i > $i > $o ).
thf(tp_leibeq2,type,
leibeq2: ( $i > $o ) > ( $i > $o ) > $o ).
thf(tp_sK1_SY0,type,
sK1_SY0: $i ).
thf(tp_sK2_SY17,type,
sK2_SY17: $i ).
thf(tp_sK3_SX0,type,
sK3_SX0: $i > $o ).
thf(leibeq1,definition,
( leibeq1
= ( ^ [X: $i,Y: $i] :
! [P: $i > $o] :
( ( P @ X )
=> ( P @ Y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq1) ).
thf(leibeq2,definition,
( leibeq2
= ( ^ [X: $i > $o,Y: $i > $o] :
! [P: ( $i > $o ) > $o] :
( ( P @ X )
=> ( P @ Y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq2) ).
thf(1,conjecture,
! [X: $i,Y: $i] :
( ( leibeq2
@ ^ [Z: $i] : ( Z = X )
@ ^ [Z: $i] : ( Z = Y ) )
=> ( leibeq1 @ X @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ! [X: $i,Y: $i] :
( ( leibeq2
@ ^ [Z: $i] : ( Z = X )
@ ^ [Z: $i] : ( Z = Y ) )
=> ( leibeq1 @ X @ Y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [SY0: $i,SY1: $i] :
( ! [SY6: ( $i > $o ) > $o] :
( ( SY6
@ ^ [Z: $i] : ( Z = SY0 ) )
=> ( SY6
@ ^ [Z: $i] : ( Z = SY1 ) ) )
=> ! [SY10: $i > $o] :
( ( SY10 @ SY0 )
=> ( SY10 @ SY1 ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,leibeq1,leibeq2]) ).
thf(4,plain,
( ( ! [SY17: $i] :
( ! [SY18: ( $i > $o ) > $o] :
( ( SY18
@ ^ [SY19: $i] : ( SY19 = sK1_SY0 ) )
=> ( SY18
@ ^ [Z: $i] : ( Z = SY17 ) ) )
=> ! [SY21: $i > $o] :
( ( SY21 @ sK1_SY0 )
=> ( SY21 @ SY17 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY22: ( $i > $o ) > $o] :
( ( SY22
@ ^ [SY19: $i] : ( SY19 = sK1_SY0 ) )
=> ( SY22
@ ^ [SY24: $i] : ( SY24 = sK2_SY17 ) ) )
=> ! [SY25: $i > $o] :
( ( SY25 @ sK1_SY0 )
=> ( SY25 @ sK2_SY17 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [SY22: ( $i > $o ) > $o] :
( ( SY22
@ ^ [SY19: $i] : ( SY19 = sK1_SY0 ) )
=> ( SY22
@ ^ [SY24: $i] : ( SY24 = sK2_SY17 ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY25: $i > $o] :
( ( SY25 @ sK1_SY0 )
=> ( SY25 @ sK2_SY17 ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(8,plain,
( ( ~ ! [SY25: $i > $o] :
( ( SY25 @ sK1_SY0 )
=> ( SY25 @ sK2_SY17 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [SY22: ( $i > $o ) > $o] :
( ( SY22
@ ^ [SY19: $i] : ( SY19 = sK1_SY0 ) )
=> ( SY22
@ ^ [SY24: $i] : ( SY24 = sK2_SY17 ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(10,plain,
( ( ~ ! [SY25: $i > $o] :
( ( SY25 @ sK1_SY0 )
=> ( SY25 @ sK2_SY17 ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ! [SX0: ( $i > $o ) > $o] :
( ~ ( SX0
@ ^ [SX1: $i] : ( SX1 = sK1_SY0 ) )
| ( SX0
@ ^ [SX1: $i] : ( SX1 = sK2_SY17 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9,leibeq1,leibeq2]) ).
thf(12,plain,
( ( ~ ! [SX0: $i > $o] :
( ~ ( SX0 @ sK1_SY0 )
| ( SX0 @ sK2_SY17 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10,leibeq1,leibeq2]) ).
thf(13,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ~ ( SV1
@ ^ [SX1: $i] : ( SX1 = sK1_SY0 ) )
| ( SV1
@ ^ [SX1: $i] : ( SX1 = sK2_SY17 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ! [SX0: $i > $o] :
( ~ ( SX0 @ sK1_SY0 )
| ( SX0 @ sK2_SY17 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ( ~ ( SV1
@ ^ [SX1: $i] : ( SX1 = sK1_SY0 ) ) )
= $true )
| ( ( SV1
@ ^ [SX1: $i] : ( SX1 = sK2_SY17 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( sK3_SX0 @ sK1_SY0 )
| ( sK3_SX0 @ sK2_SY17 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[14]) ).
thf(17,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ( SV1
@ ^ [SX1: $i] : ( SX1 = sK1_SY0 ) )
= $false )
| ( ( SV1
@ ^ [SX1: $i] : ( SX1 = sK2_SY17 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ( sK3_SX0 @ sK1_SY0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(19,plain,
( ( sK3_SX0 @ sK2_SY17 )
= $false ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(20,plain,
( ( sK3_SX0 @ sK1_SY0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(21,plain,
( ( ( ( ^ [SX0: $i] : ( SX0 = sK1_SY0 ) )
= ( ^ [SX0: $i] : ( SX0 = sK1_SY0 ) ) )
= $false )
| ( ( ( ^ [SX0: $i] : ( SX0 = sK2_SY17 ) )
= ( ^ [SX0: $i] : ( SX0 = sK1_SY0 ) ) )
= $true ) ),
inference(replace_leibnizEQ,[status(thm)],[17:[bind(SV1,$thf( ^ [SV2: $i > $o] : ( SV2 = ( ^ [SX1: $i] : ( SX1 = sK1_SY0 ) ) ) ))]]) ).
thf(22,plain,
( ( ( ^ [SX0: $i] : ( SX0 = sK2_SY17 ) )
= ( ^ [SX0: $i] : ( SX0 = sK1_SY0 ) ) )
= $true ),
inference(sim,[status(thm)],[21]) ).
thf(23,plain,
! [SV3: $i] :
( ( ( SV3 = sK2_SY17 )
= ( SV3 = sK1_SY0 ) )
= $true ),
inference(extcnf_equal_pos,[status(thm)],[22]) ).
thf(24,plain,
! [SV3: $i] :
( ( ( SV3 = sK2_SY17 )
= $true )
| ( ( SV3 = sK1_SY0 )
= $false ) ),
inference(extcnf_equal_pos,[status(thm)],[23]) ).
thf(25,plain,
! [SV3: $i] :
( ( ( SV3 = sK2_SY17 )
= $false )
| ( ( SV3 = sK1_SY0 )
= $true ) ),
inference(extcnf_equal_pos,[status(thm)],[23]) ).
thf(26,plain,
( ( sK2_SY17 = sK1_SY0 )
= $true ),
inference(extuni,[status(esa)],[25:[bind(SV3,$thf( sK2_SY17 ))]]) ).
thf(27,plain,
( ( sK1_SY0 = sK2_SY17 )
= $true ),
inference(extuni,[status(esa)],[24:[bind(SV3,$thf( sK1_SY0 ))]]) ).
thf(28,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,27,26,22,20]) ).
thf(29,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.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.10/0.16 % Computer : n026.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Oct 6 17:33:47 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 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.10/0.24
% 0.10/0.24 No.of.Axioms: 0
% 0.10/0.24
% 0.10/0.24 Length.of.Defs: 323
% 0.10/0.24
% 0.10/0.24 Contains.Choice.Funs: false
% 0.10/0.24
% 0.10/0.24 ********************************
% 0.10/0.24 * All subproblems solved! *
% 0.10/0.24 ********************************
% 0.10/0.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:1,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:28,loop_count:0,foatp_calls:2,translation:fof_full)
% 0.10/0.24
% 0.10/0.24 %**** Beginning of derivation protocol ****
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24
% 0.10/0.24 %**** End of derivation protocol ****
% 0.10/0.24 %**** no. of clauses in derivation: 29 ****
% 0.10/0.24 %**** clause counter: 28 ****
% 0.10/0.24
% 0.10/0.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:1,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:28,loop_count:0,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------