TSTP Solution File: SYO607+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYO607+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:49:50 EDT 2023
% Result : Theorem 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 5
% Syntax : Number of formulae : 73 ( 6 unt; 0 def)
% Number of atoms : 370 ( 0 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 377 ( 80 ~; 258 |; 34 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 237 ( 83 sgn; 35 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(true_only_g,axiom,
! [X3,X4] :
( g_true_only(X3,X4)
<=> ( g_true(X3,X4)
& ~ g_false(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p',true_only_g) ).
fof(nc6,conjecture,
( ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ( ? [X1] :
( ( g_both(a,X1)
| ( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) ) )
& ~ g_true_only(a,X1)
& ~ ! [X2] : g_true_only(X1,X2) )
& ~ ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
& ? [X1] :
( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) )
& ~ ? [X1] :
! [X2] : g_true_only(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p',nc6) ).
fof(both_g,axiom,
! [X3,X4] :
( g_both(X3,X4)
<=> ( g_true(X3,X4)
& g_false(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p',both_g) ).
fof(exhaustion_g,axiom,
! [X3,X4] :
( g_true_only(X3,X4)
| g_both(X3,X4)
| g_false_only(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p',exhaustion_g) ).
fof(false_only_g,axiom,
! [X3,X4] :
( g_false_only(X3,X4)
<=> ( g_false(X3,X4)
& ~ g_true(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p',false_only_g) ).
fof(c_0_5,plain,
! [X3,X4] :
( g_true_only(X3,X4)
<=> ( g_true(X3,X4)
& ~ g_false(X3,X4) ) ),
inference(fof_simplification,[status(thm)],[true_only_g]) ).
fof(c_0_6,negated_conjecture,
~ ( ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ( ? [X1] :
( ( g_both(a,X1)
| ( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) ) )
& ~ g_true_only(a,X1)
& ~ ! [X2] : g_true_only(X1,X2) )
& ~ ? [X1] :
( g_false_only(a,X1)
& ? [X2] : g_false_only(X1,X2) )
& ? [X1] :
( ? [X2] : g_both(X1,X2)
& ~ ? [X2] : g_false_only(X1,X2) )
& ~ ? [X1] :
! [X2] : g_true_only(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nc6])]) ).
fof(c_0_7,plain,
! [X20,X21] :
( ( g_true(X20,X21)
| ~ g_true_only(X20,X21) )
& ( ~ g_false(X20,X21)
| ~ g_true_only(X20,X21) )
& ( ~ g_true(X20,X21)
| g_false(X20,X21)
| g_true_only(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X26,X27] :
( ( g_true(X26,X27)
| ~ g_both(X26,X27) )
& ( g_false(X26,X27)
| ~ g_both(X26,X27) )
& ( ~ g_true(X26,X27)
| ~ g_false(X26,X27)
| g_both(X26,X27) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[both_g])])]) ).
fof(c_0_9,negated_conjecture,
! [X5,X6,X7,X9,X10,X12,X15,X16,X19] :
( ( ~ g_false_only(a,X5)
| ~ g_false_only(X5,X6) )
& ~ g_true_only(X7,esk1_1(X7))
& ( g_false_only(a,esk3_0)
| ~ g_both(a,X9)
| g_true_only(a,X9)
| g_true_only(X9,X12)
| ~ g_both(X15,X16)
| g_false_only(X15,esk5_1(X15))
| g_true_only(esk6_0,X19) )
& ( g_false_only(esk3_0,esk4_0)
| ~ g_both(a,X9)
| g_true_only(a,X9)
| g_true_only(X9,X12)
| ~ g_both(X15,X16)
| g_false_only(X15,esk5_1(X15))
| g_true_only(esk6_0,X19) )
& ( g_false_only(a,esk3_0)
| ~ g_both(X9,X10)
| g_false_only(X9,esk2_1(X9))
| g_true_only(a,X9)
| g_true_only(X9,X12)
| ~ g_both(X15,X16)
| g_false_only(X15,esk5_1(X15))
| g_true_only(esk6_0,X19) )
& ( g_false_only(esk3_0,esk4_0)
| ~ g_both(X9,X10)
| g_false_only(X9,esk2_1(X9))
| g_true_only(a,X9)
| g_true_only(X9,X12)
| ~ g_both(X15,X16)
| g_false_only(X15,esk5_1(X15))
| g_true_only(esk6_0,X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( ~ g_false(X1,X2)
| ~ g_true_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( g_false(X1,X2)
| ~ g_both(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( g_false_only(a,esk3_0)
| g_true_only(a,X1)
| g_true_only(X1,X2)
| g_false_only(X3,esk5_1(X3))
| g_true_only(esk6_0,X5)
| ~ g_both(a,X1)
| ~ g_both(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ g_both(X1,X2)
| ~ g_true_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X22,X23] :
( g_true_only(X22,X23)
| g_both(X22,X23)
| g_false_only(X22,X23) ),
inference(variable_rename,[status(thm)],[exhaustion_g]) ).
cnf(c_0_15,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(X2,X3)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,esk3_0)
| ~ g_both(a,X2)
| ~ g_both(X4,X5) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( g_true_only(X1,X2)
| g_both(X1,X2)
| g_false_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(a,esk3_0)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,X1)
| ~ g_both(X4,X5) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,esk3_0)
| g_false_only(a,X2)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ g_true_only(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(ef,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X3,X4] :
( g_false_only(X3,X4)
<=> ( g_false(X3,X4)
& ~ g_true(X3,X4) ) ),
inference(fof_simplification,[status(thm)],[false_only_g]) ).
cnf(c_0_22,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X1,X2)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X24,X25] :
( ( g_false(X24,X25)
| ~ g_false_only(X24,X25) )
& ( ~ g_true(X24,X25)
| ~ g_false_only(X24,X25) )
& ( ~ g_false(X24,X25)
| g_true(X24,X25)
| g_false_only(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_24,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
( ~ g_true(X1,X2)
| ~ g_false_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
( g_true(X1,X2)
| ~ g_true_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( ~ g_false_only(a,X1)
| ~ g_false_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_false_only(a,esk5_1(a))
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X3,X4)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,X1)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_30,plain,
( ~ g_true_only(X1,X2)
| ~ g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( g_false_only(esk3_0,esk4_0)
| g_true_only(a,X1)
| g_true_only(X1,X2)
| g_false_only(X3,esk5_1(X3))
| g_true_only(esk6_0,X5)
| ~ g_both(a,X1)
| ~ g_both(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( g_true_only(a,esk5_1(a))
| g_false_only(a,esk3_0)
| ~ g_false_only(esk5_1(a),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X2,X3)
| g_false_only(X2,esk5_1(X2))
| g_false_only(a,esk3_0)
| g_false_only(a,X1)
| g_false_only(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,X1)
| ~ g_false_only(esk5_1(a),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,X1)
| ~ g_true_only(a,esk5_1(a)) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(X2,X3)
| g_false_only(X4,esk5_1(X4))
| g_false_only(esk3_0,esk4_0)
| ~ g_both(a,X2)
| ~ g_both(X4,X5) ),
inference(csr,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( g_true_only(esk5_1(a),X1)
| g_true_only(a,X2)
| g_false_only(a,esk3_0)
| g_false_only(a,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,X1)
| ~ g_both(X4,X5) ),
inference(spm,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_39,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(X3,esk5_1(X3))
| g_false_only(esk3_0,esk4_0)
| g_false_only(a,X2)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_41,negated_conjecture,
( g_false_only(a,esk3_0)
| g_false_only(X1,esk2_1(X1))
| g_true_only(a,X1)
| g_true_only(X1,X3)
| g_false_only(X4,esk5_1(X4))
| g_true_only(esk6_0,X6)
| ~ g_both(X1,X2)
| ~ g_both(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(a,esk3_0)
| g_false_only(X4,esk5_1(X4))
| g_false_only(X4,X5)
| ~ g_false_only(X1,X6) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_43,negated_conjecture,
( g_true_only(a,esk3_0)
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X3,X4)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,X1)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4)
| ~ g_both(X2,X6) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_16]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( g_true_only(a,esk3_0)
| ~ g_false_only(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X2,X3)
| g_false_only(X2,esk5_1(X2))
| g_false_only(esk3_0,esk4_0)
| g_false_only(a,X1)
| g_false_only(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,X1)
| ~ g_false_only(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,X1)
| ~ g_true_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_50,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X1,X4)
| g_true_only(X5,X6)
| g_false_only(X5,esk5_1(X5))
| g_false_only(a,esk3_0)
| g_false_only(X5,X6) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_16]),c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( g_true_only(esk3_0,X1)
| g_true_only(a,X2)
| g_false_only(a,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_48]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4) ),
inference(ef,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X3,X4)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,esk3_0)
| g_false_only(X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( g_true_only(a,X1)
| ~ g_false_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(X2,X3)
| g_false_only(a,esk3_0)
| g_false_only(X2,esk5_1(X2))
| g_false_only(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(a,X2)
| g_true_only(X2,X3)
| g_false_only(a,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(a,X2)
| g_false_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( g_false_only(esk3_0,esk4_0)
| g_false_only(X1,esk2_1(X1))
| g_true_only(a,X1)
| g_true_only(X1,X3)
| g_false_only(X4,esk5_1(X4))
| g_true_only(esk6_0,X6)
| ~ g_both(X1,X2)
| ~ g_both(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_60,negated_conjecture,
( g_true_only(a,X1)
| g_false_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X2,esk2_1(X2))
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4)
| ~ g_both(X2,X6) ),
inference(spm,[status(thm)],[c_0_59,c_0_16]) ).
cnf(c_0_62,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X4,esk5_1(X4))
| g_false_only(X4,X5)
| ~ g_false_only(X1,X6) ),
inference(spm,[status(thm)],[c_0_27,c_0_40]) ).
cnf(c_0_63,negated_conjecture,
g_false_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_19,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X1,X4)
| g_true_only(X5,X6)
| g_false_only(X5,esk5_1(X5))
| g_false_only(esk3_0,esk4_0)
| g_false_only(X5,X6) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_16]),c_0_62]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
~ g_false_only(esk3_0,X1),
inference(spm,[status(thm)],[c_0_27,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( g_true_only(esk6_0,X1)
| g_true_only(a,X2)
| g_true_only(X3,X4)
| g_true_only(X2,X5)
| g_true_only(X2,X6)
| g_false_only(X3,esk5_1(X3))
| g_false_only(X3,X4) ),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( g_true_only(a,X1)
| g_true_only(esk6_0,X2)
| g_true_only(X1,X3)
| g_true_only(X4,X5)
| g_false_only(X4,esk5_1(X4))
| g_false_only(X4,X5) ),
inference(ef,[status(thm)],[c_0_66]) ).
cnf(c_0_68,negated_conjecture,
( g_true_only(esk3_0,X1)
| g_true_only(esk6_0,X2)
| g_true_only(a,X3)
| g_true_only(X3,X4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_67]),c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ g_true_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_30,c_0_63]) ).
cnf(c_0_70,negated_conjecture,
( g_true_only(esk3_0,X1)
| g_true_only(esk6_0,X2) ),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_68]),c_0_69]) ).
cnf(c_0_71,negated_conjecture,
g_true_only(esk3_0,X1),
inference(spm,[status(thm)],[c_0_19,c_0_70]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_19,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO607+1 : TPTP v8.1.2. Released v7.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 15:32:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.NBTIazDzJj/E---3.1_3381.p
% 0.20/0.55 # Version: 3.1pre001
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 3460 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # SAT001_MinMin_p005000_rr_RG with pid 3464 completed with status 0
% 0.20/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Theorem
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 5
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 16
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 16
% 0.20/0.55 # Processed clauses : 493
% 0.20/0.55 # ...of these trivial : 8
% 0.20/0.55 # ...subsumed : 251
% 0.20/0.55 # ...remaining for further processing : 234
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 174
% 0.20/0.55 # Backward-rewritten : 15
% 0.20/0.55 # Generated clauses : 2260
% 0.20/0.55 # ...of the previous two non-redundant : 2008
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 36
% 0.20/0.55 # Paramodulations : 2109
% 0.20/0.55 # Factorizations : 150
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Total rewrite steps : 189
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 28
% 0.20/0.55 # Positive orientable unit clauses : 4
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 3
% 0.20/0.55 # Non-unit-clauses : 21
% 0.20/0.55 # Current number of unprocessed clauses: 34
% 0.20/0.55 # ...number of literals in the above : 207
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 206
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 3757
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 1116
% 0.20/0.55 # Non-unit clause-clause subsumptions : 457
% 0.20/0.55 # Unit Clause-clause subsumption calls : 58
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 4
% 0.20/0.55 # BW rewrite match successes : 4
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 42233
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.071 s
% 0.20/0.55 # System time : 0.002 s
% 0.20/0.55 # Total time : 0.073 s
% 0.20/0.55 # Maximum resident set size: 1752 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.072 s
% 0.20/0.55 # System time : 0.004 s
% 0.20/0.55 # Total time : 0.076 s
% 0.20/0.55 # Maximum resident set size: 1676 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------