%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : LCL181+1 : TPTP v9.3.1. Released v2.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 : 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 10:28:10 AM UTC 2026
% Result : Theorem 0.09s 0.13s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 42 ( 39 unt; 0 typ; 0 def)
% Number of atoms : 183 ( 42 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 155 ( 98 ~; 28 |; 8 &; 0 @)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $o ).
thf(tp_q,type,
q: $o ).
thf(1,conjecture,
( ( ~ p
=> q )
<=> ( ~ q
=> p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel4) ).
thf(2,negated_conjecture,
( ( ( ~ p
=> q )
<=> ( ~ q
=> p ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ~ p
=> q )
<=> ( ~ q
=> p ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ~ p
=> q )
=> ( ~ q
=> p ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(5,plain,
( ( ( ~ q
=> p )
=> ( ~ p
=> q ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(6,plain,
( ( ~ ( ( ~ p
=> q )
=> ( ~ q
=> p ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ~ ( ( ~ q
=> p )
=> ( ~ p
=> q ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(8,plain,
( ( ( p
| q )
& ~ q
& ~ p )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(9,plain,
( ( ( q
| p )
& ~ p
& ~ q )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ( p
| q )
& ~ q
& ~ p )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( ~ ( p
| q )
| ~ ~ ( ~ ~ q
| ~ ~ p ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ ( p
| q )
| ~ ~ ( ~ ~ q
| ~ ~ p ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(13,plain,
( ( ~ ( p
| q ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(14,plain,
( ( ~ ~ ( ~ ~ q
| ~ ~ p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( p
| q )
= $true ),
inference(extcnf_not_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( ~ ~ q
| ~ ~ p ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( p = $true )
| ( q = $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ~ q
| ~ ~ p )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ~ q )
= $false ),
inference(extcnf_or_neg,[status(thm)],[18]) ).
thf(20,plain,
( ( ~ ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[18]) ).
thf(21,plain,
( ( ~ q ) = $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(22,plain,
( ( ~ p ) = $true ),
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(23,plain,
q = $false,
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(24,plain,
p = $false,
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(25,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[17,24,23]) ).
thf(26,plain,
( ( ( q
| p )
& ~ p
& ~ q )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(27,plain,
( ( ~ ( ~ ( q
| p )
| ~ ~ ( ~ ~ p
| ~ ~ q ) ) )
= $true ),
inference(unfold_def,[status(thm)],[26]) ).
thf(28,plain,
( ( ~ ( q
| p )
| ~ ~ ( ~ ~ p
| ~ ~ q ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(29,plain,
( ( ~ ( q
| p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(30,plain,
( ( ~ ~ ( ~ ~ p
| ~ ~ q ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[28]) ).
thf(31,plain,
( ( q
| p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(32,plain,
( ( ~ ( ~ ~ p
| ~ ~ q ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(33,plain,
( ( q = $true )
| ( p = $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(34,plain,
( ( ~ ~ p
| ~ ~ q )
= $false ),
inference(extcnf_not_pos,[status(thm)],[32]) ).
thf(35,plain,
( ( ~ ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(36,plain,
( ( ~ ~ q )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(37,plain,
( ( ~ p ) = $true ),
inference(extcnf_not_neg,[status(thm)],[35]) ).
thf(38,plain,
( ( ~ q ) = $true ),
inference(extcnf_not_neg,[status(thm)],[36]) ).
thf(39,plain,
p = $false,
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(40,plain,
q = $false,
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(41,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[33,40,39]) ).
thf(42,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[41,25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL181+1 : TPTP v9.3.1. Released v2.0.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.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Oct 6 12:10:46 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 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: 0
% 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: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:41,loop_count:0,foatp_calls:1,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: 42 ****
% 0.09/0.13 %**** clause counter: 41 ****
% 0.09/0.13
% 0.09/0.13 % 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:41,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------