%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO371^5 : 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/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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:08:09 AM UTC 2026
% Result : Theorem 0.07s 0.22s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 62 ( 37 unt; 0 typ; 0 def)
% Number of atoms : 289 ( 84 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 135 ( 48 ~; 40 |; 0 &; 28 @)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cP,type,
cP: $o ).
thf(tp_cQ,type,
cQ: $o ).
thf(1,conjecture,
( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) )
=> ( cP
<=> cQ ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEXT_O_LEIB) ).
thf(2,negated_conjecture,
( ( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) )
=> ( cP
<=> cQ ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) )
=> ( cP
<=> cQ ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( cP
<=> cQ )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( cP
=> cQ )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(7,plain,
( ( cQ
=> cP )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[5]) ).
thf(8,plain,
( ( ~ ( cP
=> cQ ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(9,plain,
( ( ~ ( cQ
=> cP ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(11,plain,
( ( ~ ( cP
=> cQ ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
( ( ~ ( ~ cP
| cQ ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(13,plain,
( ( ! [SX0: $o > $o] :
( ~ ( SX0 @ cP )
| ( SX0 @ cQ ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(14,plain,
( ( ~ cP
| cQ )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: $o > $o] :
( ( ~ ( SV1 @ cP )
| ( SV1 @ cQ ) )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ $true
| $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(17,plain,
( ( ~ $false
| $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(18,plain,
( ( ~ cP
| cQ )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(19,plain,
( ( ~ ~ cP
| ~ cQ )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[13]) ).
thf(20,plain,
( ( ~ cP ) = $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(21,plain,
cQ = $false,
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(22,plain,
! [SV1: $o > $o] :
( ( ( ~ ( SV1 @ cP ) )
= $true )
| ( ( SV1 @ cQ )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(23,plain,
( ( ( ~ $true ) = $true )
| ( $true = $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(24,plain,
( ( ( ~ $false ) = $true )
| ( $false = $true ) ),
inference(extcnf_or_pos,[status(thm)],[17]) ).
thf(25,plain,
( ( ( ~ cP ) = $true )
| ( cQ = $true ) ),
inference(extcnf_or_pos,[status(thm)],[18]) ).
thf(26,plain,
( ( ( ~ ~ cP )
= $true )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[19]) ).
thf(27,plain,
cP = $true,
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(28,plain,
! [SV1: $o > $o] :
( ( ( SV1 @ cP )
= $false )
| ( ( SV1 @ cQ )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(29,plain,
( ( $true = $false )
| ( $true = $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(30,plain,
( ( $false = $false )
| ( $false = $true ) ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(31,plain,
( ( cP = $false )
| ( cQ = $true ) ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(32,plain,
( ( ( ~ cP ) = $false )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(33,plain,
( ( cP = $true )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_not_neg,[status(thm)],[32]) ).
thf(34,plain,
( ( cQ = $false )
| ( cP = $true ) ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(35,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[21,34,31,30,29,28,27]) ).
thf(36,plain,
( ( ! [R: $o > $o] :
( ( R @ cP )
=> ( R @ cQ ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(37,plain,
( ( ~ ( cQ
=> cP ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(38,plain,
( ( ! [SX0: $o > $o] :
( ~ ( SX0 @ cP )
| ( SX0 @ cQ ) ) )
= $true ),
inference(unfold_def,[status(thm)],[36]) ).
thf(39,plain,
( ( ~ ( ~ cQ
| cP ) )
= $true ),
inference(unfold_def,[status(thm)],[37]) ).
thf(40,plain,
! [SV3: $o > $o] :
( ( ~ ( SV3 @ cP )
| ( SV3 @ cQ ) )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[38]) ).
thf(41,plain,
( ( ~ $true
| $true )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[38]) ).
thf(42,plain,
( ( ~ $false
| $false )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[38]) ).
thf(43,plain,
( ( ~ cP
| cQ )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[38]) ).
thf(44,plain,
( ( ~ ~ cP
| ~ cQ )
= $true ),
inference(extcnf_forall_special_pos,[status(thm)],[38]) ).
thf(45,plain,
( ( ~ cQ
| cP )
= $false ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(46,plain,
! [SV3: $o > $o] :
( ( ( ~ ( SV3 @ cP ) )
= $true )
| ( ( SV3 @ cQ )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[40]) ).
thf(47,plain,
( ( ( ~ $true ) = $true )
| ( $true = $true ) ),
inference(extcnf_or_pos,[status(thm)],[41]) ).
thf(48,plain,
( ( ( ~ $false ) = $true )
| ( $false = $true ) ),
inference(extcnf_or_pos,[status(thm)],[42]) ).
thf(49,plain,
( ( ( ~ cP ) = $true )
| ( cQ = $true ) ),
inference(extcnf_or_pos,[status(thm)],[43]) ).
thf(50,plain,
( ( ( ~ ~ cP )
= $true )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_or_pos,[status(thm)],[44]) ).
thf(51,plain,
( ( ~ cQ ) = $false ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(52,plain,
cP = $false,
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(53,plain,
! [SV3: $o > $o] :
( ( ( SV3 @ cP )
= $false )
| ( ( SV3 @ cQ )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[46]) ).
thf(54,plain,
( ( $true = $false )
| ( $true = $true ) ),
inference(extcnf_not_pos,[status(thm)],[47]) ).
thf(55,plain,
( ( $false = $false )
| ( $false = $true ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(56,plain,
( ( cP = $false )
| ( cQ = $true ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(57,plain,
( ( ( ~ cP ) = $false )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(58,plain,
cQ = $true,
inference(extcnf_not_neg,[status(thm)],[51]) ).
thf(59,plain,
( ( cP = $true )
| ( ( ~ cQ ) = $true ) ),
inference(extcnf_not_neg,[status(thm)],[57]) ).
thf(60,plain,
( ( cQ = $false )
| ( cP = $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(61,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[52,60,58,56,55,54,53]) ).
thf(62,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[61,35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO371^5 : 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/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.18 % Computer : n016.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Oct 6 17:44:11 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/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.07/0.22
% 0.07/0.22 No.of.Axioms: 0
% 0.07/0.22
% 0.07/0.22 Length.of.Defs: 0
% 0.07/0.22
% 0.07/0.22 Contains.Choice.Funs: false
% 0.07/0.22
% 0.07/0.22 ********************************
% 0.07/0.22 * All subproblems solved! *
% 0.07/0.22 ********************************
% 0.07/0.22 % 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:61,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.22
% 0.07/0.22 %**** Beginning of derivation protocol ****
% 0.07/0.22 % SZS output start CNFRefutation
% See solution above
% 0.07/0.22
% 0.07/0.22 %**** End of derivation protocol ****
% 0.07/0.22 %**** no. of clauses in derivation: 62 ****
% 0.07/0.22 %**** clause counter: 61 ****
% 0.07/0.22
% 0.07/0.22 % 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:61,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------