%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO058^4 : 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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:30 AM UTC 2026
% Result : Theorem 0.09s 0.20s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 32 ( 30 unt; 0 typ; 19 def)
% Number of atoms : 98 ( 29 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 61 ( 5 ~; 1 |; 1 &; 53 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 22 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 31 ^; 7 !; 2 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i > $o ).
thf(tp_iand,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_iatom,type,
iatom: ( $i > $o ) > $i > $o ).
thf(tp_icountersatisfiable,type,
icountersatisfiable: ( $i > $o ) > $o ).
thf(tp_iequiv,type,
iequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_ifalse,type,
ifalse: $i > $o ).
thf(tp_iimplied,type,
iimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_iimplies,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_iinvalid,type,
iinvalid: ( $i > $o ) > $o ).
thf(tp_inot,type,
inot: ( $i > $o ) > $i > $o ).
thf(tp_ior,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_irel,type,
irel: $i > $i > $o ).
thf(tp_isatisfiable,type,
isatisfiable: ( $i > $o ) > $o ).
thf(tp_itrue,type,
itrue: $i > $o ).
thf(tp_ivalid,type,
ivalid: ( $i > $o ) > $o ).
thf(tp_ixor,type,
ixor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mand,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mbox_s4,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(tp_mimplies,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_mnot,type,
mnot: ( $i > $o ) > $i > $o ).
thf(tp_mor,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(tp_sK1_SY0,type,
sK1_SY0: $i ).
thf(iand,definition,
( iand
= ( ^ [P: $i > $o,Q: $i > $o] : ( mand @ P @ Q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iand) ).
thf(iatom,definition,
( iatom
= ( ^ [P: $i > $o] : P ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iatom) ).
thf(icountersatisfiable,definition,
( icountersatisfiable
= ( ^ [Phi: $i > $o] :
? [W: $i] :
~ ( Phi @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',icountersatisfiable) ).
thf(iequiv,definition,
( iequiv
= ( ^ [P: $i > $o,Q: $i > $o] : ( iand @ ( iimplies @ P @ Q ) @ ( iimplies @ Q @ P ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iequiv) ).
thf(ifalse,definition,
( ifalse
= ( inot @ itrue ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifalse) ).
thf(iimplied,definition,
( iimplied
= ( ^ [P: $i > $o,Q: $i > $o] : ( iimplies @ Q @ P ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iimplied) ).
thf(iimplies,definition,
( iimplies
= ( ^ [P: $i > $o,Q: $i > $o] : ( mimplies @ ( mbox_s4 @ P ) @ ( mbox_s4 @ Q ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iimplies) ).
thf(iinvalid,definition,
( iinvalid
= ( ^ [Phi: $i > $o] :
! [W: $i] :
~ ( Phi @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iinvalid) ).
thf(inot,definition,
( inot
= ( ^ [P: $i > $o] : ( mnot @ ( mbox_s4 @ P ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inot) ).
thf(ior,definition,
( ior
= ( ^ [P: $i > $o,Q: $i > $o] : ( mor @ ( mbox_s4 @ P ) @ ( mbox_s4 @ Q ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ior) ).
thf(isatisfiable,definition,
( isatisfiable
= ( ^ [Phi: $i > $o] :
? [W: $i] : ( Phi @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isatisfiable) ).
thf(itrue,definition,
( itrue
= ( ^ [W: $i] : $true ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',itrue) ).
thf(ivalid,definition,
( ivalid
= ( ^ [Phi: $i > $o] :
! [W: $i] : ( Phi @ W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ivalid) ).
thf(ixor,definition,
( ixor
= ( ^ [P: $i > $o,Q: $i > $o] : ( inot @ ( iequiv @ P @ Q ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ixor) ).
thf(mand,definition,
( mand
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
& ( Y @ U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand) ).
thf(mbox_s4,definition,
( mbox_s4
= ( ^ [P: $i > $o,X: $i] :
! [Y: $i] :
( ( irel @ X @ Y )
=> ( P @ Y ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_s4) ).
thf(mimplies,definition,
( mimplies
= ( ^ [U: $i > $o,V: $i > $o] : ( mor @ ( mnot @ U ) @ V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies) ).
thf(mnot,definition,
( mnot
= ( ^ [X: $i > $o,U: $i] :
~ ( X @ U ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mnot) ).
thf(mor,definition,
( mor
= ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
( ( X @ U )
| ( Y @ U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mor) ).
thf(1,axiom,
ivalid @ ( iatom @ a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
thf(4,conjecture,
ivalid @ ( iatom @ a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(5,negated_conjecture,
( ( ivalid @ ( iatom @ a ) )
= $false ),
inference(negate_conjecture,[status(cth)],[4]) ).
thf(6,plain,
( ( ! [SY0: $i] : ( a @ SY0 ) )
= $false ),
inference(unfold_def,[status(thm)],[5,iand,iatom,icountersatisfiable,iequiv,ifalse,iimplied,iimplies,iinvalid,inot,ior,isatisfiable,itrue,ivalid,ixor,mand,mbox_s4,mimplies,mnot,mor]) ).
thf(7,plain,
( ( ! [SY2: $i] : ( a @ SY2 ) )
= $true ),
inference(unfold_def,[status(thm)],[1,iand,iatom,icountersatisfiable,iequiv,ifalse,iimplied,iimplies,iinvalid,inot,ior,isatisfiable,itrue,ivalid,ixor,mand,mbox_s4,mimplies,mnot,mor]) ).
thf(8,plain,
( ( a @ sK1_SY0 )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[6]) ).
thf(9,plain,
( ( ~ ( a @ sK1_SY0 ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(10,plain,
( ( ! [SY2: $i] : ( a @ SY2 ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( a @ sK1_SY0 ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(12,plain,
! [SV1: $i] :
( ( a @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( a @ sK1_SY0 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,13]) ).
thf(15,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO058^4 : 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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.16 % Computer : n015.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Oct 6 17:34:58 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.20
% 0.09/0.20 No.of.Axioms: 1
% 0.09/0.20
% 0.09/0.20 Length.of.Defs: 2734
% 0.09/0.20
% 0.09/0.20 Contains.Choice.Funs: false
% 0.09/0.20
% 0.09/0.20 ********************************
% 0.09/0.20 * All subproblems solved! *
% 0.09/0.20 ********************************
% 0.09/0.20 % SZS status Theorem for /export/starexec/sandbox/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:14,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.20
% 0.09/0.20 %**** Beginning of derivation protocol ****
% 0.09/0.20 % SZS output start CNFRefutation
% See solution above
% 0.09/0.20
% 0.09/0.20 %**** End of derivation protocol ****
% 0.09/0.20 %**** no. of clauses in derivation: 13 ****
% 0.09/0.20 %**** clause counter: 14 ****
% 0.09/0.20
% 0.09/0.20 % SZS status Theorem for /export/starexec/sandbox/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:14,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------