%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN933+1 : TPTP v9.3.1. Released v3.1.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 : n010.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:11 AM UTC 2026
% Result : Theorem 0.10s 0.22s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 28 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 95 ( 26 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 43 ( 28 ~; 4 |; 4 &; 0 @)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 1 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 0 ^; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_c,type,
c: $o ).
thf(1,conjecture,
( ! [X: $i] : c
<=> c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
( ( ! [X: $i] : c
<=> c )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i] : c
<=> c )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] : c
=> c )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(5,plain,
( ( c
=> ! [X: $i] : c )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(6,plain,
( ( ~ ( ! [X: $i] : c
=> c ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ~ ( c
=> ! [X: $i] : c ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(8,plain,
( ( c
& ~ c )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(9,plain,
( ( c
& ~ c )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( c
& ~ c )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( ~ c
| ~ ~ c ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ c
| ~ ~ c )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(13,plain,
( ( ~ c ) = $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(14,plain,
( ( ~ ~ c )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(15,plain,
c = $true,
inference(extcnf_not_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ c ) = $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(17,plain,
c = $false,
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(18,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,17]) ).
thf(19,plain,
( ( c
& ~ c )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(20,plain,
( ( ~ ( ~ c
| ~ ~ c ) )
= $true ),
inference(unfold_def,[status(thm)],[19]) ).
thf(21,plain,
( ( ~ c
| ~ ~ c )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(22,plain,
( ( ~ c ) = $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(23,plain,
( ( ~ ~ c )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(24,plain,
c = $true,
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(25,plain,
( ( ~ c ) = $true ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(26,plain,
c = $false,
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(27,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[24,26]) ).
thf(28,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[27,18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN933+1 : TPTP v9.3.1. Released v3.1.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.18 % Computer : n010.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Oct 6 17:30:10 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 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.22
% 0.10/0.22 No.of.Axioms: 0
% 0.10/0.22
% 0.10/0.22 Length.of.Defs: 0
% 0.10/0.22
% 0.10/0.22 Contains.Choice.Funs: false
% 0.10/0.22
% 0.10/0.22 ********************************
% 0.10/0.22 * All subproblems solved! *
% 0.10/0.22 ********************************
% 0.10/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,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:27,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.10/0.22
% 0.10/0.22 %**** Beginning of derivation protocol ****
% 0.10/0.22 % SZS output start CNFRefutation
% See solution above
% 0.10/0.22
% 0.10/0.22 %**** End of derivation protocol ****
% 0.10/0.22 %**** no. of clauses in derivation: 28 ****
% 0.10/0.22 %**** clause counter: 27 ****
% 0.10/0.22
% 0.10/0.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,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:27,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------