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