%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN009-4 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:31:18 PM UTC 2026
% Result : Unsatisfiable 0.05s 5.36s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 7 unt; 6 nHn; 23 RR)
% Number of literals : 62 ( 0 equ; 43 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_3,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ r(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_8,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| r(X1,X2,X3)
| q(X1,X2,X3)
| p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_1,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ q(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_7,negated_conjecture,
~ n(c,c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_9,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| n(X1,X2,X3)
| m(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,negated_conjecture,
s(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(c_0_7,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ r(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| r(X1,X2,X3)
| q(X1,X2,X3)
| p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_9,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_10,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ q(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_11,negated_conjecture,
~ n(c,c,c),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_12,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| n(X1,X2,X3)
| m(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ r(X1,X2,X3) ),
c_0_7 ).
cnf(c_0_14,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| r(X1,X2,X3)
| q(X1,X2,X3)
| p(X1,X2,X3) ),
c_0_8 ).
cnf(c_0_15,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ p(X1,X2,X3) ),
c_0_9 ).
cnf(c_0_16,negated_conjecture,
( ~ m(X1,X2,X3)
| ~ q(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_17,negated_conjecture,
~ n(c,c,c),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
( ~ s(X3)
| ~ s(X2)
| ~ s(X1)
| n(X1,X2,X3)
| m(X1,X2,X3) ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
s(c),
clause_6 ).
cnf(c_0_20,negated_conjecture,
( ~ m(X3,X2,X1)
| ~ s(X3)
| ~ s(X2)
| ~ s(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
m(c,c,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN009-4 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/5.32 % Computer : n012.cluster.edu
% 0.05/5.32 % Model : x86_64 x86_64
% 0.05/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/5.32 % Memory : 8046.5625MB
% 0.05/5.32 % OS : Linux 6.8.0-71-generic
% 0.05/5.32 % CPULimit : 300
% 0.05/5.32 % WCLimit : 300
% 0.05/5.32 % DateTime : Mon Sep 21 10:38:57 UTC 2026
% 0.05/5.32 % CPUTime :
% 0.05/5.32 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.05/5.35 Running first-order theorem proving
% 0.05/5.35 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.05/5.36 % Version: 3.5.1
% 0.05/5.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/5.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.05/5.36 % Starting new_bool_1 with 300s (1) cores
% 0.05/5.36 % Starting sh5l with 300s (1) cores
% 0.05/5.36 % new_bool_3 with pid 2175663 completed with status 0
% 0.05/5.36 % Result found by new_bool_3
% 0.05/5.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/5.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.05/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.05/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.05/5.36 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.05/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.05/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.05/5.36 % SubtermCWHack with pid 2175668 completed with status 0
% 0.05/5.36 % Result found by SubtermCWHack
% 0.05/5.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.05/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/5.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.05/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.05/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.05/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.05/5.36 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.05/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.05/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.05/5.36 % Preprocessing time : 0.001 s
% 0.05/5.36
% 0.05/5.36 % Proof found!
% 0.05/5.36 % SZS status Unsatisfiable
% 0.05/5.36 % SZS output start CNFRefutation
% See solution above
% 0.05/5.36 % Parsed axioms : 9
% 0.05/5.36 % Removed by relevancy pruning/SinE : 0
% 0.05/5.36 % Initial clauses : 9
% 0.05/5.36 % Removed in clause preprocessing : 0
% 0.05/5.36 % Initial clauses in saturation : 9
% 0.05/5.36 % Processed clauses : 11
% 0.05/5.36 % ...of these trivial : 0
% 0.05/5.36 % ...subsumed : 0
% 0.05/5.36 % ...remaining for further processing : 11
% 0.05/5.36 % Other redundant clauses eliminated : 0
% 0.05/5.36 % Clauses deleted for lack of memory : 0
% 0.05/5.36 % Backward-subsumed : 0
% 0.05/5.36 % Backward-rewritten : 0
% 0.05/5.36 % Generated clauses : 3
% 0.05/5.36 % ...of the previous two non-redundant : 2
% 0.05/5.36 % ...aggressively subsumed : 0
% 0.05/5.36 % Contextual simplify-reflections : 2
% 0.05/5.36 % Paramodulations : 3
% 0.05/5.36 % Factorizations : 0
% 0.05/5.36 % NegExts : 0
% 0.05/5.36 % Equation resolutions : 0
% 0.05/5.36 % Disequality decompositions : 0
% 0.05/5.36 % Total rewrite steps : 2
% 0.05/5.36 % ...of those cached : 1
% 0.05/5.36 % Propositional unsat checks : 0
% 0.05/5.36 % Propositional check models : 0
% 0.05/5.36 % Propositional check unsatisfiable : 0
% 0.05/5.36 % Propositional clauses : 0
% 0.05/5.36 % Propositional clauses after purity: 0
% 0.05/5.36 % Propositional unsat core size : 0
% 0.05/5.36 % Propositional preprocessing time : 0.000
% 0.05/5.36 % Propositional encoding time : 0.000
% 0.05/5.36 % Propositional solver time : 0.000
% 0.05/5.36 % Success case prop preproc time : 0.000
% 0.05/5.36 % Success case prop encoding time : 0.000
% 0.05/5.36 % Success case prop solver time : 0.000
% 0.05/5.36 % Current number of processed clauses : 11
% 0.05/5.36 % Positive orientable unit clauses : 4
% 0.05/5.36 % Positive unorientable unit clauses: 0
% 0.05/5.36 % Negative unit clauses : 1
% 0.05/5.36 % Non-unit-clauses : 6
% 0.05/5.36 % Current number of unprocessed clauses: 0
% 0.05/5.36 % ...number of literals in the above : 0
% 0.05/5.36 % Current number of archived formulas : 0
% 0.05/5.36 % Current number of archived clauses : 0
% 0.05/5.36 % Clause-clause subsumption calls (NU) : 19
% 0.05/5.36 % Rec. Clause-clause subsumption calls : 6
% 0.05/5.36 % Non-unit clause-clause subsumptions : 2
% 0.05/5.36 % Unit Clause-clause subsumption calls : 0
% 0.05/5.36 % Rewrite failures with RHS unbound : 0
% 0.05/5.36 % BW rewrite match attempts : 0
% 0.05/5.36 % BW rewrite match successes : 0
% 0.05/5.36 % Condensation attempts : 0
% 0.05/5.36 % Condensation successes : 0
% 0.05/5.36 % Termbank termtop insertions : 301
% 0.05/5.36 % Search garbage collected termcells : 21
% 0.05/5.36
% 0.05/5.36 % -------------------------------------------------
% 0.05/5.36 % User time : 0.002 s
% 0.05/5.36 % System time : 0.001 s
% 0.05/5.36 % Total time : 0.003 s
% 0.05/5.36 % Maximum resident set size: 3632 pages
% 0.05/5.36
% 0.05/5.36 % -------------------------------------------------
% 0.05/5.36 % User time : 0.004 s
% 0.05/5.36 % System time : 0.003 s
% 0.05/5.36 % Total time : 0.007 s
% 0.05/5.36 % Maximum resident set size: 4864 pages
% 0.05/5.36 % E exiting
%------------------------------------------------------------------------------