%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : SYN949+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/sandbox/solver/bin/eprover /export/starexec/sandbox/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:13 AM UTC 2026
% Result : Theorem 0.07s 0.22s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 1
% Syntax : Number of formulae : 42 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 212 ( 47 equ; 0 cnn)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 304 ( 57 ~; 21 |; 33 &; 171 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 ^; 74 !; 18 ?; 92 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $i > $o ).
thf(tp_q,type,
q: $i > $i > $o ).
thf(tp_r,type,
r: $i > $i > $o ).
thf(tp_s,type,
s: $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY8,type,
sK2_SY8: $i ).
thf(tp_sK3_SY15,type,
sK3_SY15: $i ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( ( s @ A )
& ( s @ B )
& ( r @ B @ C )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
( ( ! [A: $i,B: $i,C: $i] :
( ( ( s @ A )
& ( s @ B )
& ( r @ B @ C )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i,B: $i,C: $i] :
( ( ( s @ A )
& ( s @ B )
& ( r @ B @ C )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY8: $i,SY9: $i] :
( ( ( s @ sK1_A )
& ( s @ SY8 )
& ( r @ SY8 @ SY9 )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY15: $i] :
( ( ( s @ sK1_A )
& ( s @ sK2_SY8 )
& ( r @ sK2_SY8 @ SY15 )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ( ( s @ sK1_A )
& ( s @ sK2_SY8 )
& ( r @ sK2_SY8 @ sK3_SY15 )
& ! [X: $i] :
( ( s @ X )
=> ( p @ X ) )
& ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
=> ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[5]) ).
thf(7,plain,
( ( s @ sK1_A )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(8,plain,
( ( s @ sK2_SY8 )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(9,plain,
( ( r @ sK2_SY8 @ sK3_SY15 )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(10,plain,
( ( ! [X: $i] :
( ( s @ X )
=> ( p @ X ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(12,plain,
( ( ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[6]) ).
thf(13,plain,
( ( ~ ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[12]) ).
thf(14,plain,
( ( ! [X: $i,Y: $i] :
( ( r @ X @ Y )
=> ( q @ X @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(15,plain,
( ( ! [X: $i] :
( ( s @ X )
=> ( p @ X ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( r @ sK2_SY8 @ sK3_SY15 )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(17,plain,
( ( s @ sK2_SY8 )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(18,plain,
( ( s @ sK1_A )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(19,plain,
( ( ~ ? [X: $i,Y: $i] :
( ( p @ X )
& ( q @ X @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(20,plain,
( ( ! [SX0: $i] :
( ~ ( s @ SX0 )
| ( p @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(21,plain,
( ( ! [SX0: $i,SX1: $i] :
( ~ ( r @ SX0 @ SX1 )
| ( q @ SX0 @ SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(22,plain,
( ( ~ ~ ! [SX0: $i] :
~ ~ ! [SX1: $i] :
~ ~ ( ~ ( p @ SX0 )
| ~ ( q @ SX0 @ SX1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[19]) ).
thf(23,plain,
! [SV1: $i] :
( ( ~ ( s @ SV1 )
| ( p @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(24,plain,
! [SV2: $i] :
( ( ! [SY26: $i] :
( ~ ( r @ SV2 @ SY26 )
| ( q @ SV2 @ SY26 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(25,plain,
( ( ~ ! [SX0: $i] :
~ ~ ! [SX1: $i] :
~ ~ ( ~ ( p @ SX0 )
| ~ ( q @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(26,plain,
! [SV1: $i] :
( ( ( ~ ( s @ SV1 ) )
= $true )
| ( ( p @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[23]) ).
thf(27,plain,
! [SV3: $i,SV2: $i] :
( ( ~ ( r @ SV2 @ SV3 )
| ( q @ SV2 @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(28,plain,
( ( ! [SX0: $i] :
~ ~ ! [SX1: $i] :
~ ~ ( ~ ( p @ SX0 )
| ~ ( q @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[25]) ).
thf(29,plain,
! [SV1: $i] :
( ( ( s @ SV1 )
= $false )
| ( ( p @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(30,plain,
! [SV3: $i,SV2: $i] :
( ( ( ~ ( r @ SV2 @ SV3 ) )
= $true )
| ( ( q @ SV2 @ SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV4: $i] :
( ( ~ ~ ! [SY27: $i] :
~ ~ ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SY27 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(32,plain,
! [SV3: $i,SV2: $i] :
( ( ( r @ SV2 @ SV3 )
= $false )
| ( ( q @ SV2 @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(33,plain,
! [SV4: $i] :
( ( ~ ! [SY27: $i] :
~ ~ ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SY27 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(34,plain,
! [SV4: $i] :
( ( ! [SY27: $i] :
~ ~ ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SY27 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[33]) ).
thf(35,plain,
! [SV5: $i,SV4: $i] :
( ( ~ ~ ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[34]) ).
thf(36,plain,
! [SV5: $i,SV4: $i] :
( ( ~ ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SV5 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(37,plain,
! [SV5: $i,SV4: $i] :
( ( ~ ( p @ SV4 )
| ~ ( q @ SV4 @ SV5 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[36]) ).
thf(38,plain,
! [SV5: $i,SV4: $i] :
( ( ( ~ ( p @ SV4 ) )
= $true )
| ( ( ~ ( q @ SV4 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[37]) ).
thf(39,plain,
! [SV5: $i,SV4: $i] :
( ( ( p @ SV4 )
= $false )
| ( ( ~ ( q @ SV4 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(40,plain,
! [SV5: $i,SV4: $i] :
( ( ( q @ SV4 @ SV5 )
= $false )
| ( ( p @ SV4 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(41,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,40,32,29,18,17]) ).
thf(42,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN949+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/sandbox/solver/bin/eprover /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.18 % Computer : n017.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:25:31 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/sandbox/solver/bin/eprover /export/starexec/sandbox/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 ********************************
% 0.07/0.22 * All subproblems solved! *
% 0.07/0.22 ********************************
% 0.07/0.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:5,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:41,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: 42 ****
% 0.07/0.22 %**** clause counter: 41 ****
% 0.07/0.22
% 0.07/0.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:1,axioms:5,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:41,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------