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