%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN077-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 : n017.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.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 31 ( 3 unt; 8 nHn; 28 RR)
% Number of literals : 83 ( 7 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( ~ big_f(X3,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( ~ big_f(X1,h(X2))
| big_f(X2,a)
| big_f(i(X2,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,axiom,
( ~ big_f(X1,f(X2))
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X1,a)
| big_f(g(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_7,negated_conjecture,
( ~ big_f(X2,h(X1))
| big_f(i(X1,X2),h(X1))
| big_f(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_2,axiom,
( X1 != X2
| big_f(X1,f(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,negated_conjecture,
( big_f(X1,a)
| big_f(X1,h(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_7,negated_conjecture,
( ~ big_f(X3,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(X1,a) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_f(X1,h(X2))
| big_f(X2,a)
| big_f(i(X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_9,plain,
( ~ big_f(X1,f(X2))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X1,a)
| big_f(g(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ big_f(X3,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(X1,a) ),
c_0_7 ).
cnf(c_0_12,negated_conjecture,
( ~ big_f(X1,h(X2))
| big_f(X2,a)
| big_f(i(X2,X1),X1) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
( ~ big_f(X2,h(X1))
| big_f(i(X1,X2),h(X1))
| big_f(X1,a) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_14,plain,
( ~ big_f(X1,f(X2))
| X1 = X2 ),
c_0_9 ).
cnf(c_0_15,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X1,a)
| big_f(g(X1,X2),X2) ),
c_0_10 ).
cnf(c_0_16,plain,
( X1 != X2
| big_f(X1,f(X2)) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_f(X2,X3)
| ~ big_f(X2,a)
| ~ big_f(g(X2,X3),h(X1))
| ~ big_f(i(X1,g(X2,X3)),X3)
| big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ big_f(X2,h(X1))
| big_f(i(X1,X2),h(X1))
| big_f(X1,a) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,f(X2))
| g(X1,f(X2)) = X2 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( X1 != X2
| big_f(X1,f(X2)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( ~ big_f(X2,a)
| ~ big_f(X2,h(X1))
| big_f(X1,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X3,a)
| ~ big_f(X3,f(X2))
| ~ big_f(X1,f(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
big_f(X1,f(X1)),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ big_f(X2,h(X1))
| ~ big_f(i(X1,X2),a)
| big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ big_f(X2,X2)
| ~ big_f(X1,a)
| ~ big_f(X1,f(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( ~ big_f(a,h(X1))
| big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( big_f(X1,a)
| big_f(X1,h(X1)) ),
clause_5 ).
cnf(c_0_28,negated_conjecture,
( ~ big_f(X1,X1)
| ~ big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
big_f(a,a),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN077-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.11/5.38 % Computer : n017.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 10:37:18 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % sh5l with pid 2118340 completed with status 0
% 0.15/5.45 % Result found by sh5l
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.45 % SubtermCWHack with pid 2118347 completed with status 0
% 0.15/5.45 % Result found by SubtermCWHack
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/5.45 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.15/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Unsatisfiable
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 7
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 7
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 7
% 0.15/5.45 % Processed clauses : 37
% 0.15/5.45 % ...of these trivial : 0
% 0.15/5.45 % ...subsumed : 2
% 0.15/5.45 % ...remaining for further processing : 35
% 0.15/5.45 % Other redundant clauses eliminated : 1
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 2
% 0.15/5.45 % Backward-rewritten : 0
% 0.15/5.45 % Generated clauses : 50
% 0.15/5.45 % ...of the previous two non-redundant : 46
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 1
% 0.15/5.45 % Paramodulations : 49
% 0.15/5.45 % Factorizations : 0
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 1
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 3
% 0.15/5.45 % ...of those cached : 1
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 32
% 0.15/5.45 % Positive orientable unit clauses : 2
% 0.15/5.45 % Positive unorientable unit clauses: 0
% 0.15/5.45 % Negative unit clauses : 0
% 0.15/5.45 % Non-unit-clauses : 30
% 0.15/5.45 % Current number of unprocessed clauses: 16
% 0.15/5.45 % ...number of literals in the above : 44
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 2
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 152
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 108
% 0.15/5.45 % Non-unit clause-clause subsumptions : 5
% 0.15/5.45 % Unit Clause-clause subsumption calls : 0
% 0.15/5.45 % Rewrite failures with RHS unbound : 0
% 0.15/5.45 % BW rewrite match attempts : 0
% 0.15/5.45 % BW rewrite match successes : 0
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 1384
% 0.15/5.45 % Search garbage collected termcells : 22
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.005 s
% 0.15/5.45 % System time : 0.002 s
% 0.15/5.45 % Total time : 0.007 s
% 0.15/5.45 % Maximum resident set size: 3632 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.007 s
% 0.15/5.45 % System time : 0.007 s
% 0.15/5.45 % Total time : 0.013 s
% 0.15/5.45 % Maximum resident set size: 4608 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------