%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN312-1 : TPTP v9.3.1. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:23:37 PM UTC 2026
% Result : Unsatisfiable 0.22s 5.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 14 unt; 0 nHn; 34 RR)
% Number of literals : 57 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
cnf(clause4,negated_conjecture,
( ~ p(X1,X2,X3)
| p(X1,X2,f(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause2,negated_conjecture,
( ~ p(X3,X2,X1)
| p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause5,negated_conjecture,
( ~ p(X1,X2,X3)
| p(g(X1),X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause3,negated_conjecture,
( ~ p(X2,X1,X3)
| p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause1,negated_conjecture,
( ~ p(X4,X2,X3)
| ~ p(X1,X4,X3)
| p(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause7,negated_conjecture,
p(f(b),d,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).
cnf(clause6,negated_conjecture,
p(a,f(b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(c_0_8,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
inference(fof_simplification,[status(thm)],[clause8]) ).
cnf(c_0_9,negated_conjecture,
( ~ p(X1,X2,X3)
| p(X1,X2,f(X3)) ),
inference(fof_simplification,[status(thm)],[clause4]) ).
cnf(c_0_10,negated_conjecture,
( ~ p(X3,X2,X1)
| p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_11,negated_conjecture,
( ~ p(X1,X2,X3)
| p(g(X1),X2,X3) ),
inference(fof_simplification,[status(thm)],[clause5]) ).
cnf(c_0_12,negated_conjecture,
~ p(f(g(a)),f(g(d)),f(g(c))),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
( ~ p(X1,X2,X3)
| p(X1,X2,f(X3)) ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
( ~ p(X3,X2,X1)
| p(X1,X2,X3) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
( ~ p(X1,X2,X3)
| p(g(X1),X2,X3) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
( ~ p(X2,X1,X3)
| p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause3]) ).
cnf(c_0_17,negated_conjecture,
~ p(f(g(a)),f(g(d)),g(c)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ p(X3,X2,X1)
| p(X1,X2,g(X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ p(X2,X1,X3)
| p(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( ~ p(X3,X2,X1)
| p(f(X1),X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
~ p(c,f(g(d)),f(g(a))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ p(X3,X1,X2)
| p(X1,f(X2),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ p(f(g(a)),c,g(d)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( ~ p(X4,X2,X3)
| ~ p(X1,X4,X3)
| p(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_25,negated_conjecture,
~ p(d,c,f(g(a))),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ p(X2,X1,X3)
| p(X1,X2,f(X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_27,negated_conjecture,
( ~ p(X4,X2,X3)
| ~ p(X1,X4,X3)
| p(X1,X2,X3) ),
c_0_24 ).
cnf(c_0_28,negated_conjecture,
p(f(b),d,c),
clause7 ).
cnf(c_0_29,negated_conjecture,
~ p(c,d,g(a)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ p(X1,f(b),c)
| p(X1,d,c) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
p(a,f(b),c),
clause6 ).
cnf(c_0_32,negated_conjecture,
~ p(a,d,c),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN312-1 : TPTP v9.3.1. Bugfixed v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 % Computer : n011.cluster.edu
% 0.16/5.43 % Model : x86_64 x86_64
% 0.16/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.43 % Memory : 8046.5625MB
% 0.16/5.43 % OS : Linux 6.8.0-71-generic
% 0.16/5.43 % CPULimit : 300
% 0.16/5.44 % WCLimit : 300
% 0.16/5.44 % DateTime : Mon Sep 21 10:49:01 UTC 2026
% 0.16/5.44 % CPUTime :
% 0.16/5.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 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.22/5.59 % Version: 3.5.1
% 0.22/5.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.59 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.59 % Starting sh5l with 300s (1) cores
% 0.22/5.59 % new_bool_3 with pid 1712114 completed with status 0
% 0.22/5.59 % Result found by new_bool_3
% 0.22/5.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/5.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/5.59 % Search class: FHUNF-FFSF11-SFFFFFNN
% 0.22/5.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/5.59 % Starting SubtermCWHack with 31s (1) cores
% 0.22/5.59 % SubtermCWHack with pid 1712118 completed with status 0
% 0.22/5.59 % Result found by SubtermCWHack
% 0.22/5.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/5.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/5.59 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/5.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/5.59 % Search class: FHUNF-FFSF11-SFFFFFNN
% 0.22/5.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/5.59 % Starting SubtermCWHack with 31s (1) cores
% 0.22/5.59 % Preprocessing time : 0.002 s
% 0.22/5.59
% 0.22/5.59 % Proof found!
% 0.22/5.59 % SZS status Unsatisfiable
% 0.22/5.59 % SZS output start CNFRefutation
% See solution above
% 0.22/5.59 % Parsed axioms : 8
% 0.22/5.59 % Removed by relevancy pruning/SinE : 0
% 0.22/5.59 % Initial clauses : 8
% 0.22/5.59 % Removed in clause preprocessing : 0
% 0.22/5.59 % Initial clauses in saturation : 8
% 0.22/5.59 % Processed clauses : 146
% 0.22/5.59 % ...of these trivial : 2
% 0.22/5.59 % ...subsumed : 47
% 0.22/5.59 % ...remaining for further processing : 97
% 0.22/5.59 % Other redundant clauses eliminated : 0
% 0.22/5.59 % Clauses deleted for lack of memory : 0
% 0.22/5.59 % Backward-subsumed : 0
% 0.22/5.59 % Backward-rewritten : 0
% 0.22/5.59 % Generated clauses : 214
% 0.22/5.59 % ...of the previous two non-redundant : 188
% 0.22/5.59 % ...aggressively subsumed : 0
% 0.22/5.59 % Contextual simplify-reflections : 0
% 0.22/5.59 % Paramodulations : 214
% 0.22/5.59 % Factorizations : 0
% 0.22/5.59 % NegExts : 0
% 0.22/5.59 % Equation resolutions : 0
% 0.22/5.59 % Disequality decompositions : 0
% 0.22/5.59 % Total rewrite steps : 19
% 0.22/5.59 % ...of those cached : 4
% 0.22/5.59 % Propositional unsat checks : 0
% 0.22/5.59 % Propositional check models : 0
% 0.22/5.59 % Propositional check unsatisfiable : 0
% 0.22/5.59 % Propositional clauses : 0
% 0.22/5.59 % Propositional clauses after purity: 0
% 0.22/5.59 % Propositional unsat core size : 0
% 0.22/5.59 % Propositional preprocessing time : 0.000
% 0.22/5.59 % Propositional encoding time : 0.000
% 0.22/5.59 % Propositional solver time : 0.000
% 0.22/5.59 % Success case prop preproc time : 0.000
% 0.22/5.59 % Success case prop encoding time : 0.000
% 0.22/5.59 % Success case prop solver time : 0.000
% 0.22/5.59 % Current number of processed clauses : 97
% 0.22/5.59 % Positive orientable unit clauses : 15
% 0.22/5.59 % Positive unorientable unit clauses: 0
% 0.22/5.59 % Negative unit clauses : 63
% 0.22/5.59 % Non-unit-clauses : 19
% 0.22/5.59 % Current number of unprocessed clauses: 48
% 0.22/5.59 % ...number of literals in the above : 107
% 0.22/5.59 % Current number of archived formulas : 0
% 0.22/5.59 % Current number of archived clauses : 0
% 0.22/5.59 % Clause-clause subsumption calls (NU) : 95
% 0.22/5.59 % Rec. Clause-clause subsumption calls : 95
% 0.22/5.59 % Non-unit clause-clause subsumptions : 1
% 0.22/5.59 % Unit Clause-clause subsumption calls : 959
% 0.22/5.59 % Rewrite failures with RHS unbound : 0
% 0.22/5.59 % BW rewrite match attempts : 6
% 0.22/5.59 % BW rewrite match successes : 0
% 0.22/5.59 % Condensation attempts : 0
% 0.22/5.59 % Condensation successes : 0
% 0.22/5.59 % Termbank termtop insertions : 1546
% 0.22/5.59 % Search garbage collected termcells : 17
% 0.22/5.59
% 0.22/5.59 % -------------------------------------------------
% 0.22/5.59 % User time : 0.013 s
% 0.22/5.59 % System time : 0.004 s
% 0.22/5.59 % Total time : 0.017 s
% 0.22/5.59 % Maximum resident set size: 3636 pages
% 0.22/5.59
% 0.22/5.59 % -------------------------------------------------
% 0.22/5.59 % User time : 0.015 s
% 0.22/5.59 % System time : 0.013 s
% 0.22/5.59 % Total time : 0.028 s
% 0.22/5.59 % Maximum resident set size: 4864 pages
% 0.22/5.59 % E exiting
%------------------------------------------------------------------------------