%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : PUZ082^1 : TPTP v9.3.1. Released v3.6.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 : n014.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:36:53 AM UTC 2026
% Result : Theorem 0.10s 0.20s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 30 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 104 ( 30 ~; 14 |; 0 &; 52 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_peter,type,
peter: $i ).
thf(tp_says,type,
says: $i > $o > $o ).
thf(1,axiom,
( says @ peter
@ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(2,conjecture,
~ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(3,negated_conjecture,
( ( ~ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $false ),
inference(negate_conjecture,[status(cth)],[2]) ).
thf(4,plain,
( ( ~ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $false ),
inference(unfold_def,[status(thm)],[3]) ).
thf(5,plain,
( ( says @ peter
@ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(6,plain,
( ( ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( says @ peter
@ ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(8,plain,
( ( ! [X: $o] :
( ( says @ peter @ X )
=> ~ X ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(9,plain,
( ( ! [SX0: $o] :
( ~ ( says @ peter @ SX0 )
| ~ SX0 ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( says @ peter
@ ! [SX0: $o] :
( ~ ( says @ peter @ SX0 )
| ~ SX0 ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(11,plain,
! [SV1: $o] :
( ( ~ ( says @ peter @ SV1 )
| ~ SV1 )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( says @ peter @ $true )
| ~ $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( says @ peter @ $false )
| ~ $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[9]) ).
thf(14,plain,
! [SV1: $o] :
( ( ( ~ ( says @ peter @ SV1 ) )
= $true )
| ( ( ~ SV1 ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[11]) ).
thf(15,plain,
( ( ( ~ ( says @ peter @ $true ) )
= $true )
| ( ( ~ $true ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).
thf(16,plain,
( ( ( ~ ( says @ peter @ $false ) )
= $true )
| ( ( ~ $false ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[13]) ).
thf(17,plain,
! [SV1: $o] :
( ( ( says @ peter @ SV1 )
= $false )
| ( ( ~ SV1 ) = $true ) ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( ( says @ peter @ $true )
= $false )
| ( ( ~ $true ) = $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(19,plain,
( ( ( says @ peter @ $false )
= $false )
| ( ( ~ $false ) = $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(20,plain,
! [SV1: $o] :
( ( SV1 = $false )
| ( ( says @ peter @ SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( $true = $false )
| ( ( says @ peter @ $true )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(22,plain,
( ( $false = $false )
| ( ( says @ peter @ $false )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(23,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[10,22,21,20]) ).
thf(24,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ082^1 : TPTP v9.3.1. Released v3.6.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.17 % Computer : n014.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % 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 13:59:26 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.20
% 0.10/0.20 No.of.Axioms: 1
% 0.10/0.20
% 0.10/0.20 Length.of.Defs: 0
% 0.10/0.20
% 0.10/0.20 Contains.Choice.Funs: false
% 0.10/0.20
% 0.10/0.20 ********************************
% 0.10/0.20 * All subproblems solved! *
% 0.10/0.20 ********************************
% 0.10/0.20 % 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:23,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.20
% 0.10/0.20 %**** Beginning of derivation protocol ****
% 0.10/0.20 % SZS output start CNFRefutation
% See solution above
% 0.10/0.20
% 0.10/0.20 %**** End of derivation protocol ****
% 0.10/0.20 %**** no. of clauses in derivation: 24 ****
% 0.10/0.20 %**** clause counter: 23 ****
% 0.10/0.20
% 0.10/0.20 % 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:23,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------