%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO578+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:51:22 PM UTC 2026
% Result : Theorem 0.03s 0.45s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 116 ( 37 ~; 29 |; 39 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 38 ( 0 sgn 17 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals_86,conjecture,
( ! [X150] :
( k04_buttercup10100(X150)
=> ~ b48_buttercup10098(X150) )
| ? [X147,X148,X149] :
( b48_buttercup10098(X149)
& ~ k04_buttercup10100(X149)
& ~ b48_buttercup10098(X148)
& k04_buttercup10100(X148)
& b48_buttercup10098(X147)
& k04_buttercup10100(X147) )
| ( ? [X146] :
( ~ k04_buttercup10100(X146)
& b48_buttercup10098(X146) )
& ! [X145] :
( k04_buttercup10100(X145)
=> b48_buttercup10098(X145) ) )
| ( ? [X144] :
( ~ b48_buttercup10098(X144)
& k04_buttercup10100(X144) )
& ! [X143] :
( b48_buttercup10098(X143)
=> k04_buttercup10100(X143) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_86) ).
fof(sos_21,axiom,
( ? [X63] :
( ~ k04_buttercup10100(X63)
& b48_buttercup10098(X63) )
& ! [X62] :
( k04_buttercup10100(X62)
=> b48_buttercup10098(X62) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(c_0_2,negated_conjecture,
~ ( ! [X150] :
( k04_buttercup10100(X150)
=> ~ b48_buttercup10098(X150) )
| ? [X147,X148,X149] :
( b48_buttercup10098(X149)
& ~ k04_buttercup10100(X149)
& ~ b48_buttercup10098(X148)
& k04_buttercup10100(X148)
& b48_buttercup10098(X147)
& k04_buttercup10100(X147) )
| ( ? [X146] :
( ~ k04_buttercup10100(X146)
& b48_buttercup10098(X146) )
& ! [X145] :
( k04_buttercup10100(X145)
=> b48_buttercup10098(X145) ) )
| ( ? [X144] :
( ~ b48_buttercup10098(X144)
& k04_buttercup10100(X144) )
& ! [X143] :
( b48_buttercup10098(X143)
=> k04_buttercup10100(X143) ) ) ),
inference(assume_negation,[status(cth)],[goals_86]) ).
fof(c_0_3,negated_conjecture,
~ ( ! [X150] :
( k04_buttercup10100(X150)
=> ~ b48_buttercup10098(X150) )
| ? [X147,X148,X149] :
( b48_buttercup10098(X149)
& ~ k04_buttercup10100(X149)
& ~ b48_buttercup10098(X148)
& k04_buttercup10100(X148)
& b48_buttercup10098(X147)
& k04_buttercup10100(X147) )
| ( ? [X146] :
( ~ k04_buttercup10100(X146)
& b48_buttercup10098(X146) )
& ! [X145] :
( k04_buttercup10100(X145)
=> b48_buttercup10098(X145) ) )
| ( ? [X144] :
( ~ b48_buttercup10098(X144)
& k04_buttercup10100(X144) )
& ! [X143] :
( b48_buttercup10098(X143)
=> k04_buttercup10100(X143) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,plain,
( ? [X63] :
( ~ k04_buttercup10100(X63)
& b48_buttercup10098(X63) )
& ! [X62] :
( k04_buttercup10100(X62)
=> b48_buttercup10098(X62) ) ),
inference(fof_simplification,[status(thm)],[sos_21]) ).
fof(c_0_5,negated_conjecture,
! [X152,X154,X155,X156,X157] :
( b48_buttercup10098(esk3_0)
& k04_buttercup10100(esk3_0)
& ( ~ b48_buttercup10098(X157)
| k04_buttercup10100(X157)
| b48_buttercup10098(X156)
| ~ k04_buttercup10100(X156)
| ~ b48_buttercup10098(X155)
| ~ k04_buttercup10100(X155) )
& ( k04_buttercup10100(X154)
| ~ b48_buttercup10098(X154)
| ~ b48_buttercup10098(esk2_0) )
& ( k04_buttercup10100(X154)
| ~ b48_buttercup10098(X154)
| k04_buttercup10100(esk2_0) )
& ( b48_buttercup10098(X152)
| ~ k04_buttercup10100(X152)
| ~ k04_buttercup10100(esk1_0) )
& ( b48_buttercup10098(X152)
| ~ k04_buttercup10100(X152)
| b48_buttercup10098(esk1_0) ) ),
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_3])])])])])]) ).
fof(c_0_6,plain,
! [X168] :
( ~ k04_buttercup10100(esk5_0)
& b48_buttercup10098(esk5_0)
& ( b48_buttercup10098(X168)
| ~ k04_buttercup10100(X168) ) ),
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_4])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ b48_buttercup10098(X1)
| k04_buttercup10100(X1)
| k04_buttercup10100(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
b48_buttercup10098(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
~ k04_buttercup10100(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ b48_buttercup10098(X1)
| ~ b48_buttercup10098(esk2_0)
| k04_buttercup10100(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ k04_buttercup10100(X1)
| b48_buttercup10098(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
k04_buttercup10100(esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ b48_buttercup10098(X1)
| k04_buttercup10100(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO578+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Mon Sep 21 11:55:57 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.03/0.44 % Version: 3.5.1
% 0.03/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.44 % Starting sh5l with 300s (1) cores
% 0.03/0.44 % new_bool_3 with pid 2791567 completed with status 0
% 0.03/0.44 % Result found by new_bool_3
% 0.03/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.44 % Search class: FGHNF-FSLM00-SFFFFFNN
% 0.03/0.44 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.44 % SubtermCWHack with pid 2791573 completed with status 0
% 0.03/0.44 % Result found by SubtermCWHack
% 0.03/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.45 % Search class: FGHNF-FSLM00-SFFFFFNN
% 0.03/0.45 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.03/0.45 % Preprocessing time : 0.005 s
% 0.03/0.45
% 0.03/0.45 % Proof found!
% 0.03/0.45 % SZS status Theorem
% 0.03/0.45 % SZS output start CNFRefutation
% See solution above
% 0.03/0.45 % Parsed axioms : 86
% 0.03/0.45 % Removed by relevancy pruning/SinE : 0
% 0.03/0.45 % Initial clauses : 487
% 0.03/0.45 % Removed in clause preprocessing : 0
% 0.03/0.45 % Initial clauses in saturation : 487
% 0.03/0.45 % Processed clauses : 202
% 0.03/0.45 % ...of these trivial : 0
% 0.03/0.45 % ...subsumed : 37
% 0.03/0.45 % ...remaining for further processing : 165
% 0.03/0.45 % Other redundant clauses eliminated : 0
% 0.03/0.45 % Clauses deleted for lack of memory : 0
% 0.03/0.45 % Backward-subsumed : 1
% 0.03/0.45 % Backward-rewritten : 1
% 0.03/0.45 % Generated clauses : 193
% 0.03/0.45 % ...of the previous two non-redundant : 159
% 0.03/0.45 % ...aggressively subsumed : 0
% 0.03/0.45 % Contextual simplify-reflections : 0
% 0.03/0.45 % Paramodulations : 193
% 0.03/0.45 % Factorizations : 0
% 0.03/0.45 % NegExts : 0
% 0.03/0.45 % Equation resolutions : 0
% 0.03/0.45 % Disequality decompositions : 0
% 0.03/0.45 % Total rewrite steps : 4
% 0.03/0.45 % ...of those cached : 1
% 0.03/0.45 % Propositional unsat checks : 0
% 0.03/0.45 % Propositional check models : 0
% 0.03/0.45 % Propositional check unsatisfiable : 0
% 0.03/0.45 % Propositional clauses : 0
% 0.03/0.45 % Propositional clauses after purity: 0
% 0.03/0.45 % Propositional unsat core size : 0
% 0.03/0.45 % Propositional preprocessing time : 0.000
% 0.03/0.45 % Propositional encoding time : 0.000
% 0.03/0.45 % Propositional solver time : 0.000
% 0.03/0.45 % Success case prop preproc time : 0.000
% 0.03/0.45 % Success case prop encoding time : 0.000
% 0.03/0.45 % Success case prop solver time : 0.000
% 0.03/0.45 % Current number of processed clauses : 163
% 0.03/0.45 % Positive orientable unit clauses : 37
% 0.03/0.45 % Positive unorientable unit clauses: 0
% 0.03/0.45 % Negative unit clauses : 51
% 0.03/0.45 % Non-unit-clauses : 75
% 0.03/0.45 % Current number of unprocessed clauses: 441
% 0.03/0.45 % ...number of literals in the above : 2005
% 0.03/0.45 % Current number of archived formulas : 0
% 0.03/0.45 % Current number of archived clauses : 2
% 0.03/0.45 % Clause-clause subsumption calls (NU) : 1052
% 0.03/0.45 % Rec. Clause-clause subsumption calls : 926
% 0.03/0.45 % Non-unit clause-clause subsumptions : 30
% 0.03/0.45 % Unit Clause-clause subsumption calls : 939
% 0.03/0.45 % Rewrite failures with RHS unbound : 0
% 0.03/0.45 % BW rewrite match attempts : 1
% 0.03/0.45 % BW rewrite match successes : 1
% 0.03/0.45 % Condensation attempts : 0
% 0.03/0.45 % Condensation successes : 0
% 0.03/0.45 % Termbank termtop insertions : 21381
% 0.03/0.45 % Search garbage collected termcells : 3761
% 0.03/0.45
% 0.03/0.45 % -------------------------------------------------
% 0.03/0.45 % User time : 0.020 s
% 0.03/0.45 % System time : 0.007 s
% 0.03/0.45 % Total time : 0.027 s
% 0.03/0.45 % Maximum resident set size: 4608 pages
% 0.03/0.45
% 0.03/0.45 % -------------------------------------------------
% 0.03/0.45 % User time : 0.023 s
% 0.03/0.45 % System time : 0.012 s
% 0.03/0.45 % Total time : 0.035 s
% 0.03/0.45 % Maximum resident set size: 4864 pages
% 0.03/0.45 % E exiting
%------------------------------------------------------------------------------