%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN392+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 11:05:43 AM UTC 2026
% Result : Theorem 0.08s 0.12s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 68 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 431 ( 100 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 331 ( 168 ~; 136 |; 9 &; 0 @)
% ( 12 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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_p1,type,
p1: $o ).
thf(tp_p2,type,
p2: $o ).
thf(1,conjecture,
( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).
thf(2,negated_conjecture,
( ( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( p1
<=> p2 )
=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(5,plain,
( ( ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) )
=> ( p1
<=> p2 ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(6,plain,
( ( ~ ( ( p1
<=> p2 )
=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ~ ( ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) )
=> ( p1
<=> p2 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(8,plain,
( ( ~ ( ( p1
<=> p2 )
=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ( ~ ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) )
| ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) )
| ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(11,plain,
( ( ~ ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(16,plain,
( ( ( ~ ( p2
| ~ p1 ) )
= $true )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ( ~ p1
| p2 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ( ~ p2
| p1 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ( p2
| ~ p1 )
= $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(20,plain,
( ( ~ p1
| p2 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(21,plain,
( ( ~ p2
| p1 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( p2 = $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(23,plain,
( ( ( ~ p1 ) = $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(24,plain,
( ( ( ~ p1 ) = $true )
| ( p2 = $true ) ),
inference(extcnf_or_pos,[status(thm)],[20]) ).
thf(25,plain,
( ( ( ~ p2 ) = $true )
| ( p1 = $true ) ),
inference(extcnf_or_pos,[status(thm)],[21]) ).
thf(26,plain,
( ( ( ~ p2
| p1 )
= $false )
| ( p2 = $false ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(27,plain,
( ( p1 = $true )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(28,plain,
( ( p1 = $false )
| ( p2 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(29,plain,
( ( p2 = $false )
| ( p1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(30,plain,
( ( ( ~ p2 ) = $false )
| ( p2 = $false ) ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(31,plain,
( ( p1 = $false )
| ( p2 = $false ) ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(32,plain,
( ( ( ~ p2
| p1 )
= $false )
| ( p1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(33,plain,
( ( p2 = $true )
| ( p2 = $false ) ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(34,plain,
( ( ( ~ p2 ) = $false )
| ( p1 = $true ) ),
inference(extcnf_or_neg,[status(thm)],[32]) ).
thf(35,plain,
( ( p1 = $false )
| ( p1 = $true ) ),
inference(extcnf_or_neg,[status(thm)],[32]) ).
thf(36,plain,
( ( p2 = $true )
| ( p1 = $true ) ),
inference(extcnf_not_neg,[status(thm)],[34]) ).
thf(37,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[28,36,35,33,31,29]) ).
thf(38,plain,
( ( ~ ( ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) )
=> ( p1
<=> p2 ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(39,plain,
( ( ~ ( ~ ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) )
| ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[38]) ).
thf(40,plain,
( ( ~ ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) )
| ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(41,plain,
( ( ~ ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(42,plain,
( ( ~ ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(43,plain,
( ( ~ ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[41]) ).
thf(44,plain,
( ( ~ ( ~ p1
| p2 )
| ~ ( ~ p2
| p1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[42]) ).
thf(45,plain,
( ( ~ ( p2
| ~ p1 )
| ~ ( ~ p2
| p1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(46,plain,
( ( ( ~ ( ~ p1
| p2 ) )
= $true )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(47,plain,
( ( ~ ( p2
| ~ p1 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(48,plain,
( ( ~ ( ~ p2
| p1 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(49,plain,
( ( ( ~ p1
| p2 )
= $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[46]) ).
thf(50,plain,
( ( p2
| ~ p1 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[47]) ).
thf(51,plain,
( ( ~ p2
| p1 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[48]) ).
thf(52,plain,
( ( ( ~ p1 ) = $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[49]) ).
thf(53,plain,
( ( p2 = $false )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[49]) ).
thf(54,plain,
( ( p2 = $true )
| ( ( ~ p1 ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(55,plain,
( ( ( ~ p2 ) = $true )
| ( p1 = $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(56,plain,
( ( p1 = $true )
| ( ( ~ ( ~ p2
| p1 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[52]) ).
thf(57,plain,
( ( ( ~ p2
| p1 )
= $false )
| ( p2 = $false ) ),
inference(extcnf_not_pos,[status(thm)],[53]) ).
thf(58,plain,
( ( p1 = $false )
| ( p2 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(59,plain,
( ( p2 = $false )
| ( p1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(60,plain,
( ( ( ~ p2
| p1 )
= $false )
| ( p1 = $true ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(61,plain,
( ( ( ~ p2 ) = $false )
| ( p2 = $false ) ),
inference(extcnf_or_neg,[status(thm)],[57]) ).
thf(62,plain,
( ( p1 = $false )
| ( p2 = $false ) ),
inference(extcnf_or_neg,[status(thm)],[57]) ).
thf(63,plain,
( ( ( ~ p2 ) = $false )
| ( p1 = $true ) ),
inference(extcnf_or_neg,[status(thm)],[60]) ).
thf(64,plain,
( ( p1 = $false )
| ( p1 = $true ) ),
inference(extcnf_or_neg,[status(thm)],[60]) ).
thf(65,plain,
( ( p2 = $true )
| ( p2 = $false ) ),
inference(extcnf_not_neg,[status(thm)],[61]) ).
thf(66,plain,
( ( p2 = $true )
| ( p1 = $true ) ),
inference(extcnf_not_neg,[status(thm)],[63]) ).
thf(67,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[58,66,65,64,62,59]) ).
thf(68,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[67,37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN392+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 17:18:31 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.08/0.12
% 0.08/0.12 No.of.Axioms: 0
% 0.08/0.12
% 0.08/0.12 Length.of.Defs: 0
% 0.08/0.12
% 0.08/0.12 Contains.Choice.Funs: false
% 0.08/0.12
% 0.08/0.12 ********************************
% 0.08/0.12 * All subproblems solved! *
% 0.08/0.12 ********************************
% 0.08/0.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:0,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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:67,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.08/0.12
% 0.08/0.12 %**** Beginning of derivation protocol ****
% 0.08/0.12 % SZS output start CNFRefutation
% See solution above
% 0.08/0.12
% 0.08/0.12 %**** End of derivation protocol ****
% 0.08/0.12 %**** no. of clauses in derivation: 68 ****
% 0.08/0.12 %**** clause counter: 67 ****
% 0.08/0.12
% 0.08/0.12 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:0,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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:67,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------