%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN999^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 : n012.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:20 AM UTC 2026
% Result : Theorem 0.09s 0.13s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 23 unt; 0 typ; 1 def)
% Number of atoms : 78 ( 31 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 94 ( 18 ~; 8 |; 2 &; 51 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 2 ^; 22 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_leibeq,type,
leibeq: $i > $i > $o ).
thf(tp_sK1_SY0,type,
sK1_SY0: $i ).
thf(tp_sK2_SY12,type,
sK2_SY12: $i ).
thf(tp_sK3_SY16,type,
sK3_SY16: $i > $o ).
thf(leibeq,definition,
( leibeq
= ( ^ [X: $i,Y: $i] :
! [P: $i > $o] :
( ( P @ X )
=> ( P @ Y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq) ).
thf(1,conjecture,
! [X: $i,Y: $i] :
( ( leibeq @ X @ Y )
=> ( leibeq @ Y @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ! [X: $i,Y: $i] :
( ( leibeq @ X @ Y )
=> ( leibeq @ Y @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [SY0: $i,SY1: $i] :
( ! [SY4: $i > $o] :
( ( SY4 @ SY0 )
=> ( SY4 @ SY1 ) )
=> ! [SY7: $i > $o] :
( ( SY7 @ SY1 )
=> ( SY7 @ SY0 ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,leibeq]) ).
thf(4,plain,
( ( ! [SY12: $i] :
( ! [SY13: $i > $o] :
( ( SY13 @ sK1_SY0 )
=> ( SY13 @ SY12 ) )
=> ! [SY14: $i > $o] :
( ( SY14 @ SY12 )
=> ( SY14 @ sK1_SY0 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY15: $i > $o] :
( ( SY15 @ sK1_SY0 )
=> ( SY15 @ sK2_SY12 ) )
=> ! [SY16: $i > $o] :
( ( SY16 @ sK2_SY12 )
=> ( SY16 @ sK1_SY0 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [SY15: $i > $o] :
( ( SY15 @ sK1_SY0 )
=> ( SY15 @ sK2_SY12 ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY16: $i > $o] :
( ( SY16 @ sK2_SY12 )
=> ( SY16 @ sK1_SY0 ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(8,plain,
( ( ~ ! [SY16: $i > $o] :
( ( SY16 @ sK2_SY12 )
=> ( SY16 @ sK1_SY0 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ( sK3_SY16 @ sK2_SY12 )
& ~ ( sK3_SY16 @ sK1_SY0 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(10,plain,
( ( ! [SY15: $i > $o] :
( ~ ( SY15 @ sK1_SY0 )
| ( SY15 @ sK2_SY12 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(11,plain,
( ( ! [SY15: $i > $o] :
( ~ ( SY15 @ sK1_SY0 )
| ( SY15 @ sK2_SY12 ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(12,plain,
( ( ( sK3_SY16 @ sK2_SY12 )
& ~ ( sK3_SY16 @ sK1_SY0 ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( ~ ( sK3_SY16 @ sK2_SY12 )
| ~ ~ ( sK3_SY16 @ sK1_SY0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[12,leibeq]) ).
thf(14,plain,
! [SV1: $i > $o] :
( ( ~ ( SV1 @ sK1_SY0 )
| ( SV1 @ sK2_SY12 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( ~ ( sK3_SY16 @ sK2_SY12 )
| ~ ~ ( sK3_SY16 @ sK1_SY0 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(16,plain,
! [SV1: $i > $o] :
( ( ( ~ ( SV1 @ sK1_SY0 ) )
= $true )
| ( ( SV1 @ sK2_SY12 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ( sK3_SY16 @ sK2_SY12 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ~ ( sK3_SY16 @ sK1_SY0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(19,plain,
! [SV1: $i > $o] :
( ( ( SV1 @ sK1_SY0 )
= $false )
| ( ( SV1 @ sK2_SY12 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(20,plain,
( ( sK3_SY16 @ sK2_SY12 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(21,plain,
( ( ~ ( sK3_SY16 @ sK1_SY0 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( sK3_SY16 @ sK1_SY0 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(23,plain,
( ( ( sK1_SY0 = sK1_SY0 )
= $false )
| ( ( sK2_SY12 = sK1_SY0 )
= $true ) ),
inference(replace_leibnizEQ,[status(thm)],[19:[bind(SV1,$thf( ^ [SV2: $i] : ( SV2 = sK1_SY0 ) ))]]) ).
thf(24,plain,
( ( sK2_SY12 = sK1_SY0 )
= $true ),
inference(sim,[status(thm)],[23]) ).
thf(25,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[20,24,22]) ).
thf(26,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN999^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.02 % 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.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Oct 6 17:30:16 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 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.09/0.13
% 0.09/0.13 No.of.Axioms: 0
% 0.09/0.13
% 0.09/0.13 Length.of.Defs: 151
% 0.09/0.13
% 0.09/0.13 Contains.Choice.Funs: false
% 0.09/0.13
% 0.09/0.13 ********************************
% 0.09/0.13 * All subproblems solved! *
% 0.09/0.13 ********************************
% 0.09/0.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:25,loop_count:0,foatp_calls:2,translation:fof_full)
% 0.09/0.13
% 0.09/0.13 %**** Beginning of derivation protocol ****
% 0.09/0.13 % SZS output start CNFRefutation
% See solution above
% 0.09/0.13
% 0.09/0.13 %**** End of derivation protocol ****
% 0.09/0.13 %**** no. of clauses in derivation: 26 ****
% 0.09/0.13 %**** clause counter: 25 ****
% 0.09/0.13
% 0.09/0.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:15,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:25,loop_count:0,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------