%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO607+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Thu Sep 24 03:48:04 PM UTC 2026
% Result : Theorem 0.23s 5.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 5
% Syntax : Number of formulae : 73 ( 6 unt; 0 def)
% Number of atoms : 372 ( 0 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 385 ( 86 ~; 251 |; 43 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 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 : 242 ( 77 sgn 38 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nc6,conjecture,
( ( ~ ? [X1] :
! [X2] : g_true_only(X1,X2)
& ? [X1] :
( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
& ~ ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) )
& ? [X1] :
( ~ ! [X2] : g_true_only(X1,X2)
& ~ g_true_only(a,X1)
& ( ( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
| g_both(a,X1) ) ) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nc6) ).
fof(true_only_g,axiom,
! [X3,X4] :
( g_true_only(X3,X4)
<=> ( ~ g_false(X3,X4)
& g_true(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',true_only_g) ).
fof(both_g,axiom,
! [X3,X4] :
( g_both(X3,X4)
<=> ( g_false(X3,X4)
& g_true(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',both_g) ).
fof(exhaustion_g,axiom,
! [X3,X4] :
( g_false_only(X3,X4)
| g_both(X3,X4)
| g_true_only(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exhaustion_g) ).
fof(false_only_g,axiom,
! [X3,X4] :
( g_false_only(X3,X4)
<=> ( ~ g_true(X3,X4)
& g_false(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_only_g) ).
fof(c_0_5,negated_conjecture,
~ ( ( ~ ? [X1] :
! [X2] : g_true_only(X1,X2)
& ? [X1] :
( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
& ~ ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) )
& ? [X1] :
( ~ ! [X2] : g_true_only(X1,X2)
& ~ g_true_only(a,X1)
& ( ( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
| g_both(a,X1) ) ) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) ) ),
inference(assume_negation,[status(cth)],[nc6]) ).
fof(c_0_6,plain,
! [X3,X4] :
( g_true_only(X3,X4)
<=> ( ~ g_false(X3,X4)
& g_true(X3,X4) ) ),
inference(fof_simplification,[status(thm)],[true_only_g]) ).
fof(c_0_7,negated_conjecture,
~ ( ( ~ ? [X1] :
! [X2] : g_true_only(X1,X2)
& ? [X1] :
( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
& ~ ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) )
& ? [X1] :
( ~ ! [X2] : g_true_only(X1,X2)
& ~ g_true_only(a,X1)
& ( ( ~ ? [X2] : g_false_only(X1,X2)
& ? [X2] : g_both(X1,X2) )
| g_both(a,X1) ) ) )
| ? [X1] :
! [X2] : g_true_only(X1,X2)
| ? [X1] :
( ? [X2] : g_false_only(X1,X2)
& g_false_only(a,X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X20,X21] :
( ( g_true_only(X20,X21)
| g_false(X20,X21)
| ~ g_true(X20,X21) )
& ( ~ g_true_only(X20,X21)
| ~ g_false(X20,X21) )
& ( ~ g_true_only(X20,X21)
| g_true(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X22,X23] :
( ( g_both(X22,X23)
| ~ g_false(X22,X23)
| ~ g_true(X22,X23) )
& ( ~ g_both(X22,X23)
| g_false(X22,X23) )
& ( ~ g_both(X22,X23)
| g_true(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[both_g])])])]) ).
fof(c_0_10,negated_conjecture,
! [X5,X6,X7,X9,X10,X12,X15,X16,X19] :
( ( g_true_only(esk6_0,X19)
| g_false_only(X15,esk5_1(X15))
| ~ g_both(X15,X16)
| g_true_only(X9,X12)
| g_true_only(a,X9)
| g_false_only(X9,esk2_1(X9))
| ~ g_both(X9,X10)
| g_false_only(esk3_0,esk4_0) )
& ( g_true_only(esk6_0,X19)
| g_false_only(X15,esk5_1(X15))
| ~ g_both(X15,X16)
| g_true_only(X9,X12)
| g_true_only(a,X9)
| g_false_only(X9,esk2_1(X9))
| ~ g_both(X9,X10)
| g_false_only(a,esk3_0) )
& ( g_true_only(esk6_0,X19)
| g_false_only(X15,esk5_1(X15))
| ~ g_both(X15,X16)
| g_true_only(X9,X12)
| g_true_only(a,X9)
| ~ g_both(a,X9)
| g_false_only(esk3_0,esk4_0) )
& ( g_true_only(esk6_0,X19)
| g_false_only(X15,esk5_1(X15))
| ~ g_both(X15,X16)
| g_true_only(X9,X12)
| g_true_only(a,X9)
| ~ g_both(a,X9)
| g_false_only(a,esk3_0) )
& ~ g_true_only(X7,esk1_1(X7))
& ( ~ g_false_only(X5,X6)
| ~ g_false_only(a,X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
cnf(c_0_11,plain,
( ~ g_true_only(X1,X2)
| ~ g_false(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ g_both(X1,X2)
| g_false(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ g_both(X3,X4)
| ~ g_both(a,X1)
| g_true_only(esk6_0,X5)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X2)
| g_true_only(a,X1)
| g_false_only(a,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ g_true_only(X1,X2)
| ~ g_both(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X26,X27] :
( g_false_only(X26,X27)
| g_both(X26,X27)
| g_true_only(X26,X27) ),
inference(variable_rename,[status(thm)],[exhaustion_g]) ).
cnf(c_0_16,negated_conjecture,
( ~ g_both(X4,X5)
| ~ g_both(a,X2)
| g_false_only(X4,esk5_1(X4))
| g_false_only(a,esk3_0)
| g_true_only(X2,X3)
| g_true_only(esk6_0,X1) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( g_false_only(X1,X2)
| g_both(X1,X2)
| g_true_only(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ g_both(X4,X5)
| g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(X4,esk5_1(X4))
| g_true_only(X1,X3)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(a,X2)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,esk3_0)
| g_true_only(X2,X5)
| g_true_only(X3,X4)
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ g_true_only(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,esk5_1(a))
| g_true_only(X1,X3)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(ef,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X3,X4] :
( g_false_only(X3,X4)
<=> ( ~ g_true(X3,X4)
& g_false(X3,X4) ) ),
inference(fof_simplification,[status(thm)],[false_only_g]) ).
cnf(c_0_23,negated_conjecture,
( g_false_only(a,X2)
| g_false_only(a,esk3_0)
| g_false_only(a,esk5_1(a))
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X24,X25] :
( ( g_false_only(X24,X25)
| g_true(X24,X25)
| ~ g_false(X24,X25) )
& ( ~ g_false_only(X24,X25)
| ~ g_true(X24,X25) )
& ( ~ g_false_only(X24,X25)
| g_false(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_25,negated_conjecture,
( g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(a,esk5_1(a))
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_26,plain,
( ~ g_false_only(X1,X2)
| ~ g_true(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( ~ g_true_only(X1,X2)
| g_true(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( ~ g_false_only(X1,X2)
| ~ g_false_only(a,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( g_false_only(a,esk3_0)
| g_false_only(a,esk5_1(a))
| g_true_only(a,esk5_1(a)) ),
inference(ef,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_31,plain,
( ~ g_false_only(X1,X2)
| ~ g_true_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ g_both(X3,X4)
| ~ g_both(a,X1)
| g_true_only(esk6_0,X5)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X2)
| g_true_only(a,X1)
| g_false_only(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,negated_conjecture,
( ~ g_false_only(esk5_1(a),X1)
| g_false_only(a,esk3_0)
| g_true_only(a,esk5_1(a)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( g_false_only(X2,X3)
| g_false_only(a,X1)
| g_false_only(X2,esk5_1(X2))
| g_false_only(a,esk3_0)
| g_true_only(X2,X3)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ g_false_only(esk5_1(a),X2)
| g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( ~ g_true_only(a,esk5_1(a))
| g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
( ~ g_both(X4,X5)
| ~ g_both(a,X2)
| g_false_only(X4,esk5_1(X4))
| g_false_only(esk3_0,esk4_0)
| g_true_only(X2,X3)
| g_true_only(esk6_0,X1) ),
inference(csr,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_38,negated_conjecture,
( g_false_only(a,X2)
| g_false_only(a,esk3_0)
| g_true_only(a,X2)
| g_true_only(esk5_1(a),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ~ g_both(X4,X5)
| g_false_only(a,X1)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X4,esk5_1(X4))
| g_true_only(X1,X3)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
( ~ g_both(X4,X5)
| ~ g_both(X1,X2)
| g_true_only(esk6_0,X6)
| g_false_only(X4,esk5_1(X4))
| g_true_only(X1,X3)
| g_true_only(a,X1)
| g_false_only(X1,esk2_1(X1))
| g_false_only(a,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,negated_conjecture,
( g_false_only(a,X1)
| g_false_only(a,esk3_0)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(a,X2)
| g_false_only(X3,esk5_1(X3))
| g_false_only(esk3_0,esk4_0)
| g_true_only(X2,X5)
| g_true_only(X3,X4)
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
( ~ g_both(X1,X6)
| g_false_only(X3,X4)
| g_false_only(a,esk3_0)
| g_false_only(X1,esk2_1(X1))
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X5)
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_44,negated_conjecture,
( ~ g_false_only(X1,X4)
| g_false_only(X2,X3)
| g_false_only(a,esk3_0)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X2,X3)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
( g_false_only(a,esk3_0)
| g_true_only(a,esk3_0) ),
inference(ef,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(a,X1)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( g_false_only(X5,X6)
| g_false_only(X5,esk5_1(X5))
| g_false_only(a,esk3_0)
| g_true_only(X5,X6)
| g_true_only(X2,X4)
| g_true_only(X2,X3)
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_17]),c_0_44]),c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ~ g_false_only(esk3_0,X1)
| g_true_only(a,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( g_false_only(X2,X3)
| g_false_only(a,X1)
| g_false_only(X2,esk5_1(X2))
| g_false_only(esk3_0,esk4_0)
| g_true_only(X2,X3)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ g_false_only(esk3_0,X2)
| g_false_only(a,X1)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_51,negated_conjecture,
( ~ g_true_only(a,esk3_0)
| g_false_only(a,X1)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(a,esk3_0)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X5)
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(ef,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( g_false_only(a,X2)
| g_true_only(a,X2)
| g_true_only(esk3_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(X3,esk5_1(X3))
| g_false_only(a,esk3_0)
| g_true_only(X3,X4)
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( g_false_only(a,X1)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( g_false_only(X2,X3)
| g_false_only(a,esk3_0)
| g_false_only(X2,esk5_1(X2))
| g_true_only(X2,X3)
| g_true_only(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( ~ g_false_only(X1,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( g_false_only(X1,X2)
| g_false_only(X1,esk5_1(X1))
| g_false_only(a,esk3_0)
| g_true_only(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( g_false_only(a,esk3_0)
| g_true_only(X1,X2)
| g_true_only(a,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( ~ g_both(X4,X5)
| ~ g_both(X1,X2)
| g_true_only(esk6_0,X6)
| g_false_only(X4,esk5_1(X4))
| g_true_only(X1,X3)
| g_true_only(a,X1)
| g_false_only(X1,esk2_1(X1))
| g_false_only(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_61,negated_conjecture,
( g_false_only(a,esk3_0)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( ~ g_both(X1,X6)
| g_false_only(X3,X4)
| g_false_only(esk3_0,esk4_0)
| g_false_only(X1,esk2_1(X1))
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X5)
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_17]) ).
cnf(c_0_63,negated_conjecture,
g_false_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_20,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( g_false_only(X5,X6)
| g_false_only(X5,esk5_1(X5))
| g_false_only(esk3_0,esk4_0)
| g_true_only(X5,X6)
| g_true_only(X2,X4)
| g_true_only(X2,X3)
| g_true_only(a,X2)
| g_true_only(esk6_0,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_17]),c_0_57]),c_0_57]) ).
cnf(c_0_65,negated_conjecture,
~ g_false_only(esk3_0,X1),
inference(spm,[status(thm)],[c_0_28,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( g_false_only(X3,X4)
| g_false_only(X3,esk5_1(X3))
| g_true_only(X1,X6)
| g_true_only(X1,X5)
| g_true_only(X3,X4)
| g_true_only(esk6_0,X2)
| g_true_only(a,X1) ),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( g_true_only(X3,X5)
| g_true_only(X3,X4)
| g_true_only(a,X3)
| g_true_only(esk6_0,X2)
| g_true_only(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
~ g_true_only(a,esk3_0),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( g_true_only(esk6_0,X3)
| g_true_only(esk3_0,X2)
| g_true_only(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_67]),c_0_68]) ).
cnf(c_0_70,negated_conjecture,
( g_true_only(esk3_0,X2)
| g_true_only(esk6_0,X1) ),
inference(ef,[status(thm)],[c_0_69]) ).
cnf(c_0_71,negated_conjecture,
g_true_only(esk6_0,X1),
inference(spm,[status(thm)],[c_0_20,c_0_70]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_20,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYO607+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.45 % Computer : n015.cluster.edu
% 0.17/5.45 % Model : x86_64 x86_64
% 0.17/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.45 % Memory : 8046.5625MB
% 0.17/5.45 % OS : Linux 6.8.0-71-generic
% 0.17/5.46 % CPULimit : 300
% 0.17/5.46 % WCLimit : 300
% 0.17/5.46 % DateTime : Mon Sep 21 12:06:27 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.53 Running first-order theorem proving
% 0.23/5.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/5.60 % Version: 3.5.1
% 0.23/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.60 % Starting sh5l with 300s (1) cores
% 0.23/5.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1415325 completed with status 0
% 0.23/5.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.60 % No SInE strategy applied
% 0.23/5.60 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.23/5.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.60 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.60 % Starting new_bool_1 with 136s (1) cores
% 0.23/5.60 % SubtermCWHack with pid 1415329 completed with status 0
% 0.23/5.60 % Result found by SubtermCWHack
% 0.23/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.60 % No SInE strategy applied
% 0.23/5.60 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.23/5.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.60 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.60 % Preprocessing time : 0.001 s
% 0.23/5.60
% 0.23/5.60 % Proof found!
% 0.23/5.60 % SZS status Theorem
% 0.23/5.60 % SZS output start CNFRefutation
% See solution above
% 0.23/5.60 % Parsed axioms : 5
% 0.23/5.60 % Removed by relevancy pruning/SinE : 0
% 0.23/5.60 % Initial clauses : 16
% 0.23/5.60 % Removed in clause preprocessing : 0
% 0.23/5.60 % Initial clauses in saturation : 16
% 0.23/5.60 % Processed clauses : 536
% 0.23/5.60 % ...of these trivial : 16
% 0.23/5.60 % ...subsumed : 331
% 0.23/5.60 % ...remaining for further processing : 189
% 0.23/5.60 % Other redundant clauses eliminated : 0
% 0.23/5.60 % Clauses deleted for lack of memory : 0
% 0.23/5.60 % Backward-subsumed : 144
% 0.23/5.60 % Backward-rewritten : 20
% 0.23/5.60 % Generated clauses : 1962
% 0.23/5.60 % ...of the previous two non-redundant : 1731
% 0.23/5.60 % ...aggressively subsumed : 0
% 0.23/5.60 % Contextual simplify-reflections : 39
% 0.23/5.60 % Paramodulations : 1809
% 0.23/5.60 % Factorizations : 152
% 0.23/5.60 % NegExts : 0
% 0.23/5.60 % Equation resolutions : 0
% 0.23/5.60 % Disequality decompositions : 0
% 0.23/5.60 % Total rewrite steps : 171
% 0.23/5.60 % ...of those cached : 166
% 0.23/5.60 % Propositional unsat checks : 0
% 0.23/5.60 % Propositional check models : 0
% 0.23/5.60 % Propositional check unsatisfiable : 0
% 0.23/5.60 % Propositional clauses : 0
% 0.23/5.60 % Propositional clauses after purity: 0
% 0.23/5.60 % Propositional unsat core size : 0
% 0.23/5.60 % Propositional preprocessing time : 0.000
% 0.23/5.60 % Propositional encoding time : 0.000
% 0.23/5.60 % Propositional solver time : 0.000
% 0.23/5.60 % Success case prop preproc time : 0.000
% 0.23/5.60 % Success case prop encoding time : 0.000
% 0.23/5.60 % Success case prop solver time : 0.000
% 0.23/5.60 % Current number of processed clauses : 24
% 0.23/5.60 % Positive orientable unit clauses : 4
% 0.23/5.60 % Positive unorientable unit clauses: 0
% 0.23/5.60 % Negative unit clauses : 3
% 0.23/5.60 % Non-unit-clauses : 17
% 0.23/5.60 % Current number of unprocessed clauses: 27
% 0.23/5.60 % ...number of literals in the above : 124
% 0.23/5.60 % Current number of archived formulas : 0
% 0.23/5.60 % Current number of archived clauses : 165
% 0.23/5.60 % Clause-clause subsumption calls (NU) : 3269
% 0.23/5.60 % Rec. Clause-clause subsumption calls : 1019
% 0.23/5.60 % Non-unit clause-clause subsumptions : 509
% 0.23/5.60 % Unit Clause-clause subsumption calls : 51
% 0.23/5.60 % Rewrite failures with RHS unbound : 0
% 0.23/5.60 % BW rewrite match attempts : 5
% 0.23/5.60 % BW rewrite match successes : 5
% 0.23/5.60 % Condensation attempts : 0
% 0.23/5.60 % Condensation successes : 0
% 0.23/5.60 % Termbank termtop insertions : 32802
% 0.23/5.60 % Search garbage collected termcells : 275
% 0.23/5.60
% 0.23/5.60 % -------------------------------------------------
% 0.23/5.60 % User time : 0.040 s
% 0.23/5.60 % System time : 0.008 s
% 0.23/5.60 % Total time : 0.048 s
% 0.23/5.60 % Maximum resident set size: 3632 pages
% 0.23/5.60
% 0.23/5.60 % -------------------------------------------------
% 0.23/5.60 % User time : 0.198 s
% 0.23/5.60 % System time : 0.023 s
% 0.23/5.60 % Total time : 0.222 s
% 0.23/5.60 % Maximum resident set size: 4864 pages
% 0.23/5.60 % E exiting
%------------------------------------------------------------------------------