%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN088-1.010 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:32:30 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 24 unt; 0 nHn; 27 RR)
% Number of literals : 57 ( 0 equ; 33 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-10 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(s4_goal_1,negated_conjecture,
~ p(a,a,a,a,a,a,a,a,a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_goal_1) ).
cnf(s4_1,axiom,
( ~ q_10(X10)
| ~ q_9(X9)
| ~ q_8(X8)
| ~ q_7(X7)
| ~ q_6(X6)
| ~ q_5(X5)
| ~ q_4(X4)
| ~ q_3(X3)
| ~ q_2(X2)
| ~ q_1(X1)
| p(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_1) ).
cnf(s4_20,axiom,
q_10(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_20) ).
cnf(s4_18,axiom,
q_9(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_18) ).
cnf(s4_16,axiom,
q_8(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_16) ).
cnf(s4_14,axiom,
q_7(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_14) ).
cnf(s4_12,axiom,
q_6(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_12) ).
cnf(s4_10,axiom,
q_5(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_10) ).
cnf(s4_8,axiom,
q_4(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_8) ).
cnf(s4_6,axiom,
q_3(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_6) ).
cnf(s4_4,axiom,
q_2(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_4) ).
cnf(s4_2,axiom,
q_1(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_2) ).
cnf(c_0_12,negated_conjecture,
~ p(a,a,a,a,a,a,a,a,a,a),
inference(fof_simplification,[status(thm)],[s4_goal_1]) ).
cnf(c_0_13,plain,
( ~ q_10(X10)
| ~ q_9(X9)
| ~ q_8(X8)
| ~ q_7(X7)
| ~ q_6(X6)
| ~ q_5(X5)
| ~ q_4(X4)
| ~ q_3(X3)
| ~ q_2(X2)
| ~ q_1(X1)
| p(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
inference(fof_simplification,[status(thm)],[s4_1]) ).
cnf(c_0_14,negated_conjecture,
~ p(a,a,a,a,a,a,a,a,a,a),
c_0_12 ).
cnf(c_0_15,plain,
( ~ q_10(X10)
| ~ q_9(X9)
| ~ q_8(X8)
| ~ q_7(X7)
| ~ q_6(X6)
| ~ q_5(X5)
| ~ q_4(X4)
| ~ q_3(X3)
| ~ q_2(X2)
| ~ q_1(X1)
| p(X1,X2,X3,X4,X5,X6,X7,X8,X9,X10) ),
c_0_13 ).
cnf(c_0_16,axiom,
q_10(a),
s4_20 ).
cnf(c_0_17,axiom,
q_9(a),
s4_18 ).
cnf(c_0_18,axiom,
q_8(a),
s4_16 ).
cnf(c_0_19,axiom,
q_7(a),
s4_14 ).
cnf(c_0_20,axiom,
q_6(a),
s4_12 ).
cnf(c_0_21,axiom,
q_5(a),
s4_10 ).
cnf(c_0_22,axiom,
q_4(a),
s4_8 ).
cnf(c_0_23,axiom,
q_3(a),
s4_6 ).
cnf(c_0_24,axiom,
q_2(a),
s4_4 ).
cnf(c_0_25,axiom,
q_1(a),
s4_2 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN088-1.010 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.36 % Computer : n026.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Mon Sep 21 10:45:44 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.40 Running first-order theorem proving
% 0.14/5.40 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.14/5.41 % Version: 3.5.1
% 0.14/5.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.41 % Starting sh5l with 300s (1) cores
% 0.14/5.41 % new_bool_3 with pid 2063276 completed with status 0
% 0.14/5.41 % Result found by new_bool_3
% 0.14/5.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.41 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.14/5.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.41 % SubtermCWHack with pid 2063281 completed with status 0
% 0.14/5.41 % Result found by SubtermCWHack
% 0.14/5.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.41 % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.14/5.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.41 % Preprocessing time : 0.001 s
% 0.14/5.41
% 0.14/5.41 % Proof found!
% 0.14/5.41 % SZS status Unsatisfiable
% 0.14/5.41 % SZS output start CNFRefutation
% See solution above
% 0.14/5.41 % Parsed axioms : 22
% 0.14/5.41 % Removed by relevancy pruning/SinE : 0
% 0.14/5.41 % Initial clauses : 22
% 0.14/5.41 % Removed in clause preprocessing : 0
% 0.14/5.41 % Initial clauses in saturation : 22
% 0.14/5.41 % Processed clauses : 22
% 0.14/5.41 % ...of these trivial : 0
% 0.14/5.41 % ...subsumed : 0
% 0.14/5.41 % ...remaining for further processing : 22
% 0.14/5.41 % Other redundant clauses eliminated : 0
% 0.14/5.41 % Clauses deleted for lack of memory : 0
% 0.14/5.41 % Backward-subsumed : 0
% 0.14/5.41 % Backward-rewritten : 0
% 0.14/5.41 % Generated clauses : 1
% 0.14/5.41 % ...of the previous two non-redundant : 0
% 0.14/5.41 % ...aggressively subsumed : 0
% 0.14/5.41 % Contextual simplify-reflections : 0
% 0.14/5.41 % Paramodulations : 1
% 0.14/5.41 % Factorizations : 0
% 0.14/5.41 % NegExts : 0
% 0.14/5.41 % Equation resolutions : 0
% 0.14/5.41 % Disequality decompositions : 0
% 0.14/5.41 % Total rewrite steps : 10
% 0.14/5.41 % ...of those cached : 0
% 0.14/5.41 % Propositional unsat checks : 0
% 0.14/5.41 % Propositional check models : 0
% 0.14/5.41 % Propositional check unsatisfiable : 0
% 0.14/5.41 % Propositional clauses : 0
% 0.14/5.41 % Propositional clauses after purity: 0
% 0.14/5.41 % Propositional unsat core size : 0
% 0.14/5.41 % Propositional preprocessing time : 0.000
% 0.14/5.41 % Propositional encoding time : 0.000
% 0.14/5.41 % Propositional solver time : 0.000
% 0.14/5.41 % Success case prop preproc time : 0.000
% 0.14/5.41 % Success case prop encoding time : 0.000
% 0.14/5.41 % Success case prop solver time : 0.000
% 0.14/5.41 % Current number of processed clauses : 22
% 0.14/5.41 % Positive orientable unit clauses : 20
% 0.14/5.41 % Positive unorientable unit clauses: 0
% 0.14/5.41 % Negative unit clauses : 1
% 0.14/5.41 % Non-unit-clauses : 1
% 0.14/5.41 % Current number of unprocessed clauses: 0
% 0.14/5.41 % ...number of literals in the above : 0
% 0.14/5.41 % Current number of archived formulas : 0
% 0.14/5.41 % Current number of archived clauses : 0
% 0.14/5.41 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.41 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.41 % Non-unit clause-clause subsumptions : 0
% 0.14/5.41 % Unit Clause-clause subsumption calls : 0
% 0.14/5.41 % Rewrite failures with RHS unbound : 0
% 0.14/5.41 % BW rewrite match attempts : 0
% 0.14/5.41 % BW rewrite match successes : 0
% 0.14/5.41 % Condensation attempts : 0
% 0.14/5.41 % Condensation successes : 0
% 0.14/5.41 % Termbank termtop insertions : 350
% 0.14/5.41 % Search garbage collected termcells : 32
% 0.14/5.41
% 0.14/5.41 % -------------------------------------------------
% 0.14/5.41 % User time : 0.001 s
% 0.14/5.41 % System time : 0.004 s
% 0.14/5.41 % Total time : 0.005 s
% 0.14/5.41 % Maximum resident set size: 3644 pages
% 0.14/5.41
% 0.14/5.41 % -------------------------------------------------
% 0.14/5.41 % User time : 0.004 s
% 0.14/5.41 % System time : 0.007 s
% 0.14/5.41 % Total time : 0.011 s
% 0.14/5.41 % Maximum resident set size: 4608 pages
% 0.14/5.41 % E exiting
%------------------------------------------------------------------------------