%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYO114^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 : n017.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:39 AM UTC 2026
% Result : Theorem 0.12s 0.20s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 1
% Syntax : Number of formulae : 40 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 332 ( 68 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 539 ( 179 ~; 141 |; 15 &; 204 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 57 ( 0 ^; 52 !; 5 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_c,type,
c: $i ).
thf(tp_cP,type,
cP: $i > $o ).
thf(tp_cQ,type,
cQ: $i > $o ).
thf(tp_cR,type,
cR: $i > $o ).
thf(tp_d,type,
d: $i ).
thf(tp_sK1_SY3,type,
sK1_SY3: $i > $i ).
thf(1,conjecture,
~ ( ! [Xz: $i] :
( ( ( cP @ Xz )
| ( cR @ Xz ) )
& ( cQ @ Xz ) )
& ! [Xx: $i] :
? [Xy: $i] :
( ( cP @ Xx )
| ~ ( cQ @ Xx )
| ~ ( cQ @ Xy )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
& ( ~ ( cP @ a )
| ~ ( cP @ b ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM119) ).
thf(2,negated_conjecture,
( ( ~ ( ! [Xz: $i] :
( ( ( cP @ Xz )
| ( cR @ Xz ) )
& ( cQ @ Xz ) )
& ! [Xx: $i] :
? [Xy: $i] :
( ( cP @ Xx )
| ~ ( cQ @ Xx )
| ~ ( cQ @ Xy )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
& ( ~ ( cP @ a )
| ~ ( cP @ b ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ~ ( ! [Xz: $i] :
( ( ( cP @ Xz )
| ( cR @ Xz ) )
& ( cQ @ Xz ) )
& ! [Xx: $i] :
? [Xy: $i] :
( ( cP @ Xx )
| ~ ( cQ @ Xx )
| ~ ( cQ @ Xy )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
& ( ~ ( cP @ a )
| ~ ( cP @ b ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xz: $i] :
( ( ( cP @ Xz )
| ( cR @ Xz ) )
& ( cQ @ Xz ) )
& ! [Xx: $i] :
? [Xy: $i] :
( ( cP @ Xx )
| ~ ( cQ @ Xx )
| ~ ( cQ @ Xy )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
& ( ~ ( cP @ a )
| ~ ( cP @ b ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xz: $i] :
( ( ( cP @ Xz )
| ( cR @ Xz ) )
& ( cQ @ Xz ) )
& ! [Xx: $i] :
? [Xy: $i] :
( ( cP @ Xx )
| ~ ( cQ @ Xx )
| ~ ( cQ @ Xy )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
& ( ~ ( cP @ a )
| ~ ( cP @ b ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(6,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) )
| ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
| ~ ( ~ ( cP @ a )
| ~ ( cP @ b ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) )
| ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
| ~ ( ~ ( cP @ a )
| ~ ( cP @ b ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[6]) ).
thf(8,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) )
| ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[7]) ).
thf(9,plain,
( ( ~ ( ~ ( cP @ a )
| ~ ( cP @ b ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[7]) ).
thf(10,plain,
( ( ~ ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) )
| ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( cP @ a )
| ~ ( cP @ b ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) )
| ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( ( ~ ( cP @ a ) )
= $true )
| ( ( ~ ( cP @ b ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(16,plain,
( ( ( cP @ a )
= $false )
| ( ( ~ ( cP @ b ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(17,plain,
( ( ! [SX0: $i] :
~ ( ~ ( ( cP @ SX0 )
| ( cR @ SX0 ) )
| ~ ( cQ @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(18,plain,
( ( ! [SX0: $i] :
~ ! [SX1: $i] :
~ ( ( cP @ SX0 )
| ~ ( cQ @ SX0 )
| ~ ( cQ @ SX1 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ( cP @ b )
= $false )
| ( ( cP @ a )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(20,plain,
! [SV1: $i] :
( ( ~ ( ~ ( ( cP @ SV1 )
| ( cR @ SV1 ) )
| ~ ( cQ @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(21,plain,
! [SV2: $i] :
( ( ~ ! [SY3: $i] :
~ ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ SY3 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(22,plain,
! [SV1: $i] :
( ( ~ ( ( cP @ SV1 )
| ( cR @ SV1 ) )
| ~ ( cQ @ SV1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV2: $i] :
( ( ! [SY3: $i] :
~ ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ SY3 )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV1: $i] :
( ( ~ ( ( cP @ SV1 )
| ( cR @ SV1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(25,plain,
! [SV1: $i] :
( ( ~ ( cQ @ SV1 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[22]) ).
thf(26,plain,
! [SV2: $i] :
( ( ~ ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ ( sK1_SY3 @ SV2 ) )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[23]) ).
thf(27,plain,
! [SV1: $i] :
( ( ( cP @ SV1 )
| ( cR @ SV1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[24]) ).
thf(28,plain,
! [SV1: $i] :
( ( cQ @ SV1 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[25]) ).
thf(29,plain,
! [SV2: $i] :
( ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ ( sK1_SY3 @ SV2 ) )
| ~ ( cQ @ c )
| ~ ( cQ @ d ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[26]) ).
thf(30,plain,
! [SV1: $i] :
( ( ( cP @ SV1 )
= $true )
| ( ( cR @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV2: $i] :
( ( ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ ( sK1_SY3 @ SV2 ) )
| ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[29]) ).
thf(32,plain,
! [SV2: $i] :
( ( ( ( cP @ SV2 )
| ~ ( cQ @ SV2 )
| ~ ( cQ @ ( sK1_SY3 @ SV2 ) ) )
= $true )
| ( ( ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(33,plain,
! [SV2: $i] :
( ( ( ( cP @ SV2 )
| ~ ( cQ @ SV2 ) )
= $true )
| ( ( ~ ( cQ @ ( sK1_SY3 @ SV2 ) ) )
= $true )
| ( ( ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[32]) ).
thf(34,plain,
! [SV2: $i] :
( ( ( cP @ SV2 )
= $true )
| ( ( ~ ( cQ @ SV2 ) )
= $true )
| ( ( ~ ( cQ @ ( sK1_SY3 @ SV2 ) ) )
= $true )
| ( ( ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV2: $i] :
( ( ( cQ @ SV2 )
= $false )
| ( ( cP @ SV2 )
= $true )
| ( ( ~ ( cQ @ ( sK1_SY3 @ SV2 ) ) )
= $true )
| ( ( ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(36,plain,
! [SV2: $i] :
( ( ( cQ @ ( sK1_SY3 @ SV2 ) )
= $false )
| ( ( cP @ SV2 )
= $true )
| ( ( cQ @ SV2 )
= $false )
| ( ( ~ ( cQ @ c ) )
= $true )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(37,plain,
! [SV2: $i] :
( ( ( cQ @ c )
= $false )
| ( ( cQ @ SV2 )
= $false )
| ( ( cP @ SV2 )
= $true )
| ( ( cQ @ ( sK1_SY3 @ SV2 ) )
= $false )
| ( ( ~ ( cQ @ d ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[36]) ).
thf(38,plain,
! [SV2: $i] :
( ( ( cQ @ d )
= $false )
| ( ( cQ @ ( sK1_SY3 @ SV2 ) )
= $false )
| ( ( cP @ SV2 )
= $true )
| ( ( cQ @ SV2 )
= $false )
| ( ( cQ @ c )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(39,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,38,30,28]) ).
thf(40,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO114^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.12/0.17 % Computer : n017.cluster.edu
% 0.12/0.17 % Model : x86_64 x86_64
% 0.12/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.17 % Memory : 8046.5625MB
% 0.12/0.17 % OS : Linux 6.8.0-71-generic
% 0.12/0.17 % CPULimit : 300
% 0.12/0.17 % WCLimit : 300
% 0.12/0.17 % DateTime : Tue Oct 6 17:28:01 UTC 2026
% 0.12/0.17 % CPUTime :
% 0.12/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.12/0.20
% 0.12/0.20 No.of.Axioms: 0
% 0.12/0.20
% 0.12/0.20 Length.of.Defs: 0
% 0.12/0.20
% 0.12/0.20 Contains.Choice.Funs: false
% 0.12/0.20
% 0.12/0.20 ********************************
% 0.12/0.20 * All subproblems solved! *
% 0.12/0.20 ********************************
% 0.12/0.20 % 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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:39,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.20
% 0.12/0.20 %**** Beginning of derivation protocol ****
% 0.12/0.20 % SZS output start CNFRefutation
% See solution above
% 0.12/0.20
% 0.12/0.20 %**** End of derivation protocol ****
% 0.12/0.20 %**** no. of clauses in derivation: 40 ****
% 0.12/0.20 %**** clause counter: 39 ****
% 0.12/0.20
% 0.12/0.20 % 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:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:39,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------