%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : LCL005-1 : TPTP v9.3.1. Released v1.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 : n006.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 10:27:46 AM UTC 2026
% Result : Unsatisfiable 42.51s 7.35s
% Output : CNFRefutation 42.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 107 ( 30 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 307 ( 19 ~; 18 |; 0 &; 270 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 0 ^; 58 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_is_a_theorem,type,
is_a_theorem: $i > $o ).
thf(tp_not,type,
not: $i > $i ).
thf(tp_or,type,
or: $i > $i > $i ).
thf(1,axiom,
! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ X ) @ Y ) ) @ ( or @ Z @ ( or @ U @ V ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ U ) @ X ) ) @ ( or @ Z @ ( or @ V @ X ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_CAMeredith) ).
thf(2,axiom,
! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( or @ ( not @ X ) @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
thf(3,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(4,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,negated_conjecture,
~ ( is_a_theorem @ ( or @ ( not @ ( or @ a @ a ) ) @ a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_4) ).
thf(6,plain,
$false = $false,
inference(unfold_def,[status(thm)],[4]) ).
thf(7,plain,
( ( ! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ X ) @ Y ) ) @ ( or @ Z @ ( or @ U @ V ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ U ) @ X ) ) @ ( or @ Z @ ( or @ V @ X ) ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( or @ ( not @ X ) @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( ~ ( is_a_theorem @ ( or @ ( not @ ( or @ a @ a ) ) @ a ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(10,plain,
( ( ~ $false ) = $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ~ ( is_a_theorem @ ( or @ ( not @ ( or @ a @ a ) ) @ a ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(12,plain,
( ( ! [X: $i,Y: $i] :
( ~ ( is_a_theorem @ ( or @ ( not @ X ) @ Y ) )
| ~ ( is_a_theorem @ X )
| ( is_a_theorem @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(13,plain,
( ( ! [X: $i,Y: $i,Z: $i,U: $i,V: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ X ) @ Y ) ) @ ( or @ Z @ ( or @ U @ V ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ U ) @ X ) ) @ ( or @ Z @ ( or @ V @ X ) ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(14,plain,
( ( ~ $false ) = $true ),
inference(copy,[status(thm)],[10]) ).
thf(15,plain,
( ( is_a_theorem @ ( or @ ( not @ ( or @ a @ a ) ) @ a ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(16,plain,
! [SV1: $i] :
( ( ! [SY7: $i] :
( ~ ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SY7 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SY7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(17,plain,
! [SV2: $i] :
( ( ! [SY8: $i,SY9: $i,SY10: $i,SY11: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ SV2 ) @ SY8 ) ) @ ( or @ SY9 @ ( or @ SY10 @ SY11 ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ SY10 ) @ SV2 ) ) @ ( or @ SY9 @ ( or @ SY11 @ SV2 ) ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(18,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(19,plain,
! [SV3: $i,SV1: $i] :
( ( ~ ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SV3 ) )
| ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(20,plain,
! [SV4: $i,SV2: $i] :
( ( ! [SY12: $i,SY13: $i,SY14: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ SV2 ) @ SV4 ) ) @ ( or @ SY12 @ ( or @ SY13 @ SY14 ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ SY13 ) @ SV2 ) ) @ ( or @ SY12 @ ( or @ SY14 @ SV2 ) ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(21,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SV3 ) ) )
= $true )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV3 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV5: $i,SV4: $i,SV2: $i] :
( ( ! [SY15: $i,SY16: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ SV2 ) @ SV4 ) ) @ ( or @ SV5 @ ( or @ SY15 @ SY16 ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ SY15 ) @ SV2 ) ) @ ( or @ SV5 @ ( or @ SY16 @ SV2 ) ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV3: $i,SV1: $i] :
( ( ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SV3 ) )
= $false )
| ( ( ~ ( is_a_theorem @ SV1 )
| ( is_a_theorem @ SV3 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV6: $i,SV5: $i,SV4: $i,SV2: $i] :
( ( ! [SY17: $i] : ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ SV2 ) @ SV4 ) ) @ ( or @ SV5 @ ( or @ SV6 @ SY17 ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ SV6 ) @ SV2 ) ) @ ( or @ SV5 @ ( or @ SY17 @ SV2 ) ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(25,plain,
! [SV3: $i,SV1: $i] :
( ( ( ~ ( is_a_theorem @ SV1 ) )
= $true )
| ( ( is_a_theorem @ SV3 )
= $true )
| ( ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SV3 ) )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV7: $i,SV6: $i,SV5: $i,SV4: $i,SV2: $i] :
( ( is_a_theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ ( not @ SV2 ) @ SV4 ) ) @ ( or @ SV5 @ ( or @ SV6 @ SV7 ) ) ) ) @ ( or @ ( not @ ( or @ ( not @ SV6 ) @ SV2 ) ) @ ( or @ SV5 @ ( or @ SV7 @ SV2 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(27,plain,
! [SV3: $i,SV1: $i] :
( ( ( is_a_theorem @ SV1 )
= $false )
| ( ( is_a_theorem @ SV3 )
= $true )
| ( ( is_a_theorem @ ( or @ ( not @ SV1 ) @ SV3 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(28,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,27,26,18]) ).
thf(29,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % 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.06/0.20 % Computer : n006.cluster.edu
% 0.06/0.20 % Model : x86_64 x86_64
% 0.06/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.20 % Memory : 8046.5625MB
% 0.06/0.20 % OS : Linux 6.8.0-71-generic
% 0.06/0.21 % CPULimit : 300
% 0.06/0.21 % WCLimit : 300
% 0.06/0.21 % DateTime : Tue Oct 6 12:06:07 UTC 2026
% 0.06/0.21 % CPUTime :
% 0.06/0.21 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.51/7.35
% 42.51/7.35 No.of.Axioms: 3
% 42.51/7.35
% 42.51/7.35 Length.of.Defs: 0
% 42.51/7.35
% 42.51/7.35 Contains.Choice.Funs: false
% 42.51/7.35
% 42.51/7.35 ********************************
% 42.51/7.35 * All subproblems solved! *
% 42.51/7.35 ********************************
% 42.51/7.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:28,loop_count:0,foatp_calls:1,translation:fof_experiment)
% 42.51/7.35
% 42.51/7.35 %**** Beginning of derivation protocol ****
% 42.51/7.35 % SZS output start CNFRefutation
% See solution above
% 42.51/7.35
% 42.51/7.35 %**** End of derivation protocol ****
% 42.51/7.35 %**** no. of clauses in derivation: 29 ****
% 42.51/7.35 %**** clause counter: 28 ****
% 42.51/7.35
% 42.51/7.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:74,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:28,loop_count:0,foatp_calls:1,translation:fof_experiment)
%------------------------------------------------------------------------------