TSTP Solution File: SYN979+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 08:30:57 EDT 2022
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 7
% Syntax : Number of formulae : 68 ( 53 unt; 6 typ; 0 def)
% Number of atoms : 450 ( 68 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 1045 ( 380 ~; 170 |; 58 &; 413 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 105 ( 0 ^ 93 !; 12 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_p,type,
p: $i > $i > $o ).
thf(tp_q,type,
q: $i > $o ).
thf(tp_r,type,
r: $i > $o ).
thf(tp_s,type,
s: $i > $o ).
thf(tp_sK1_A,type,
sK1_A: $i ).
thf(tp_sK2_SY4,type,
sK2_SY4: $i ).
thf(1,conjecture,
! [A: $i,B: $i] :
? [X: $i,Y: $i] :
( ( ( ( q @ X )
=> ( p @ X @ A ) )
& ( q @ A )
& ( q @ B )
& ( ( r @ Y )
=> ( p @ B @ Y ) )
& ( r @ A )
& ( r @ B )
& ( ( s @ A )
=> ( p @ X @ Y ) )
& ( s @ A ) )
=> ( p @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(2,negated_conjecture,
( ( ! [A: $i,B: $i] :
? [X: $i,Y: $i] :
( ( ( ( q @ X )
=> ( p @ X @ A ) )
& ( q @ A )
& ( q @ B )
& ( ( r @ Y )
=> ( p @ B @ Y ) )
& ( r @ A )
& ( r @ B )
& ( ( s @ A )
=> ( p @ X @ Y ) )
& ( s @ A ) )
=> ( p @ A @ B ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i,B: $i] :
? [X: $i,Y: $i] :
( ( ( ( q @ X )
=> ( p @ X @ A ) )
& ( q @ A )
& ( q @ B )
& ( ( r @ Y )
=> ( p @ B @ Y ) )
& ( r @ A )
& ( r @ B )
& ( ( s @ A )
=> ( p @ X @ Y ) )
& ( s @ A ) )
=> ( p @ A @ B ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY4: $i] :
? [SY5: $i,SY6: $i] :
( ( ( ( q @ SY5 )
=> ( p @ SY5 @ sK1_A ) )
& ( q @ sK1_A )
& ( q @ SY4 )
& ( ( r @ SY6 )
=> ( p @ SY4 @ SY6 ) )
& ( r @ sK1_A )
& ( r @ SY4 )
& ( ( s @ sK1_A )
=> ( p @ SY5 @ SY6 ) )
& ( s @ sK1_A ) )
=> ( p @ sK1_A @ SY4 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ? [SY7: $i,SY8: $i] :
( ( ( ( q @ SY7 )
=> ( p @ SY7 @ sK1_A ) )
& ( q @ sK1_A )
& ( q @ sK2_SY4 )
& ( ( r @ SY8 )
=> ( p @ sK2_SY4 @ SY8 ) )
& ( r @ sK1_A )
& ( r @ sK2_SY4 )
& ( ( s @ sK1_A )
=> ( p @ SY7 @ SY8 ) )
& ( s @ sK1_A ) )
=> ( p @ sK1_A @ sK2_SY4 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ~ ? [SY7: $i,SY8: $i] :
( ( ( ( q @ SY7 )
=> ( p @ SY7 @ sK1_A ) )
& ( q @ sK1_A )
& ( q @ sK2_SY4 )
& ( ( r @ SY8 )
=> ( p @ sK2_SY4 @ SY8 ) )
& ( r @ sK1_A )
& ( r @ sK2_SY4 )
& ( ( s @ sK1_A )
=> ( p @ SY7 @ SY8 ) )
& ( s @ sK1_A ) )
=> ( p @ sK1_A @ sK2_SY4 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SY7: $i] :
( ~ ( q @ SY7 )
| ( p @ SY7 @ sK1_A ) )
& ( q @ sK1_A )
& ( q @ sK2_SY4 )
& ! [SY8: $i] :
( ~ ( r @ SY8 )
| ( p @ sK2_SY4 @ SY8 ) )
& ( r @ sK1_A )
& ( r @ sK2_SY4 )
& ( ~ ( s @ sK1_A )
| ! [SY7: $i,SY8: $i] : ( p @ SY7 @ SY8 ) )
& ( s @ sK1_A )
& ~ ( p @ sK1_A @ sK2_SY4 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [SY7: $i] :
( ~ ( q @ SY7 )
| ( p @ SY7 @ sK1_A ) )
& ( q @ sK1_A )
& ( q @ sK2_SY4 )
& ! [SY8: $i] :
( ~ ( r @ SY8 )
| ( p @ sK2_SY4 @ SY8 ) )
& ( r @ sK1_A )
& ( r @ sK2_SY4 )
& ( ~ ( s @ sK1_A )
| ! [SY7: $i,SY8: $i] : ( p @ SY7 @ SY8 ) )
& ( s @ sK1_A )
& ~ ( p @ sK1_A @ sK2_SY4 ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(9,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
| ~ ( s @ sK1_A ) )
| ~ ~ ( p @ sK1_A @ sK2_SY4 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(10,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
| ~ ( s @ sK1_A ) )
| ~ ~ ( p @ sK1_A @ sK2_SY4 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(11,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
| ~ ( s @ sK1_A ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ ~ ( p @ sK1_A @ sK2_SY4 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
| ~ ( s @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ( p @ sK1_A @ sK2_SY4 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
| ~ ( s @ sK1_A ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(16,plain,
( ( p @ sK1_A @ sK2_SY4 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ( s @ sK1_A ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(20,plain,
( ( s @ sK1_A )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(21,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
| ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(22,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(23,plain,
( ( ~ ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[21]) ).
thf(24,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(25,plain,
( ( ~ ( s @ sK1_A )
| ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(26,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
| ~ ( r @ sK2_SY4 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(27,plain,
( ( ( ~ ( s @ sK1_A ) )
= $true )
| ( ( ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[25]) ).
thf(28,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(29,plain,
( ( ~ ( r @ sK2_SY4 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[26]) ).
thf(30,plain,
( ( ( s @ sK1_A )
= $false )
| ( ( ! [SX0: $i,SX1: $i] : ( p @ SX0 @ SX1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(31,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(32,plain,
( ( r @ sK2_SY4 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(33,plain,
! [SV1: $i] :
( ( ( ! [SY9: $i] : ( p @ SV1 @ SY9 ) )
= $true )
| ( ( s @ sK1_A )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[30]) ).
thf(34,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
| ~ ( r @ sK1_A ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(35,plain,
! [SV2: $i,SV1: $i] :
( ( ( p @ SV1 @ SV2 )
= $true )
| ( ( s @ sK1_A )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(36,plain,
( ( ~ ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(37,plain,
( ( ~ ( r @ sK1_A ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(38,plain,
( ( ~ ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[36]) ).
thf(39,plain,
( ( r @ sK1_A )
= $true ),
inference(extcnf_not_neg,[status(thm)],[37]) ).
thf(40,plain,
( ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
| ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(41,plain,
( ( ~ ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(42,plain,
( ( ~ ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(43,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[41]) ).
thf(44,plain,
( ( ! [SX0: $i] :
( ~ ( r @ SX0 )
| ( p @ sK2_SY4 @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[42]) ).
thf(45,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
| ~ ( q @ sK2_SY4 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(46,plain,
! [SV3: $i] :
( ( ~ ( r @ SV3 )
| ( p @ sK2_SY4 @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(47,plain,
( ( ~ ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(48,plain,
( ( ~ ( q @ sK2_SY4 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[45]) ).
thf(49,plain,
! [SV3: $i] :
( ( ( ~ ( r @ SV3 ) )
= $true )
| ( ( p @ sK2_SY4 @ SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(50,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[47]) ).
thf(51,plain,
( ( q @ sK2_SY4 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[48]) ).
thf(52,plain,
! [SV3: $i] :
( ( ( r @ SV3 )
= $false )
| ( ( p @ sK2_SY4 @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(53,plain,
( ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) )
| ~ ( q @ sK1_A ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(54,plain,
( ( ~ ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[53]) ).
thf(55,plain,
( ( ~ ( q @ sK1_A ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[53]) ).
thf(56,plain,
( ( ! [SX0: $i] :
( ~ ( q @ SX0 )
| ( p @ SX0 @ sK1_A ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[54]) ).
thf(57,plain,
( ( q @ sK1_A )
= $true ),
inference(extcnf_not_neg,[status(thm)],[55]) ).
thf(58,plain,
! [SV4: $i] :
( ( ~ ( q @ SV4 )
| ( p @ SV4 @ sK1_A ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[56]) ).
thf(59,plain,
! [SV4: $i] :
( ( ( ~ ( q @ SV4 ) )
= $true )
| ( ( p @ SV4 @ sK1_A )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[58]) ).
thf(60,plain,
! [SV4: $i] :
( ( ( q @ SV4 )
= $false )
| ( ( p @ SV4 @ sK1_A )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[59]) ).
thf(61,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,60,57,52,51,39,35,32,20]) ).
thf(62,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 01:36:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36
% 0.12/0.36 No.of.Axioms: 0
% 0.12/0.36
% 0.12/0.36 Length.of.Defs: 0
% 0.12/0.36
% 0.12/0.36 Contains.Choice.Funs: false
% 0.12/0.36 (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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)...
% 0.12/0.41
% 0.12/0.41 ********************************
% 0.12/0.41 * All subproblems solved! *
% 0.12/0.41 ********************************
% 0.12/0.41 % 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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:61,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.41
% 0.20/0.41 %**** Beginning of derivation protocol ****
% 0.20/0.41 % SZS output start CNFRefutation
% See solution above
% 0.20/0.41
% 0.20/0.41 %**** End of derivation protocol ****
% 0.20/0.41 %**** no. of clauses in derivation: 62 ****
% 0.20/0.41 %**** clause counter: 61 ****
% 0.20/0.41
% 0.20/0.41 % 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:10,ordering:none,proof_output:1,protocol_output:false,clause_count:61,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------