%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN075-1 : 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 : n007.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:03 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 5 unt; 9 nHn; 19 RR)
% Number of literals : 64 ( 40 equ; 33 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_6,negated_conjecture,
( X1 != g(X2)
| f(X2) = X2
| big_f(X1,f(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_4,negated_conjecture,
( X1 != g(X2)
| ~ big_f(X1,f(X2))
| f(X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_9,negated_conjecture,
( f(X1) != X1
| h(X1,X2) = X2
| big_f(h(X1,X2),f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_1,axiom,
( ~ big_f(X1,X2)
| X1 = a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_10,negated_conjecture,
( ~ big_f(h(X1,X2),f(X1))
| h(X1,X2) != X2
| f(X1) != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_3,axiom,
( X2 != b
| X1 != a
| big_f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_6,negated_conjecture,
( X1 != g(X2)
| f(X2) = X2
| big_f(X1,f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_7,negated_conjecture,
( X1 != g(X2)
| ~ big_f(X1,f(X2))
| f(X2) = X2 ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_8,negated_conjecture,
( X1 != g(X2)
| f(X2) = X2
| big_f(X1,f(X2)) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( f(X1) != X1
| h(X1,X2) = X2
| big_f(h(X1,X2),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_10,negated_conjecture,
( X1 != g(X2)
| ~ big_f(X1,f(X2))
| f(X2) = X2 ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( big_f(g(X1),f(X1))
| f(X1) = X1 ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ big_f(X1,X2)
| X1 = a ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_13,negated_conjecture,
( f(X1) != X1
| h(X1,X2) = X2
| big_f(h(X1,X2),f(X1)) ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
f(X1) = X1,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_f(h(X1,X2),f(X1))
| h(X1,X2) != X2
| f(X1) != X1 ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_16,plain,
( ~ big_f(X1,X2)
| X1 = a ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
( big_f(h(X1,X2),X1)
| h(X1,X2) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
cnf(c_0_18,plain,
( X2 != b
| X1 != a
| big_f(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(h(X1,X2),f(X1))
| h(X1,X2) != X2
| f(X1) != X1 ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( h(X1,X2) = X2
| h(X1,X2) = a ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( X2 != b
| X1 != a
| big_f(X1,X2) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( ~ big_f(h(X1,X2),X1)
| h(X1,X2) != X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14]),c_0_14])]) ).
cnf(c_0_23,negated_conjecture,
h(X1,a) = a,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_20])]) ).
cnf(c_0_24,plain,
big_f(a,b),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
~ big_f(a,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN075-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.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:40:06 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.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/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 873913 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % SubtermCWHack with pid 873917 completed with status 0
% 0.14/0.42 % Result found by SubtermCWHack
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Unsatisfiable
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 10
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 10
% 0.14/0.42 % Removed in clause preprocessing : 1
% 0.14/0.42 % Initial clauses in saturation : 9
% 0.14/0.42 % Processed clauses : 24
% 0.14/0.42 % ...of these trivial : 2
% 0.14/0.42 % ...subsumed : 3
% 0.14/0.42 % ...remaining for further processing : 19
% 0.14/0.42 % Other redundant clauses eliminated : 9
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 1
% 0.14/0.42 % Backward-rewritten : 4
% 0.14/0.42 % Generated clauses : 30
% 0.14/0.42 % ...of the previous two non-redundant : 21
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 1
% 0.14/0.42 % Paramodulations : 16
% 0.14/0.42 % Factorizations : 4
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 9
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 16
% 0.14/0.42 % ...of those cached : 10
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 9
% 0.14/0.42 % Positive orientable unit clauses : 2
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 1
% 0.14/0.42 % Non-unit-clauses : 6
% 0.14/0.42 % Current number of unprocessed clauses: 4
% 0.14/0.42 % ...number of literals in the above : 11
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 7
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 8
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 7
% 0.14/0.42 % Non-unit clause-clause subsumptions : 4
% 0.14/0.42 % Unit Clause-clause subsumption calls : 1
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 2
% 0.14/0.42 % BW rewrite match successes : 2
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 551
% 0.14/0.42 % Search garbage collected termcells : 27
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.002 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.006 s
% 0.14/0.42 % Maximum resident set size: 3636 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.013 s
% 0.14/0.42 % System time : 0.009 s
% 0.14/0.42 % Total time : 0.023 s
% 0.14/0.42 % Maximum resident set size: 4864 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------