%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN070-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 : n012.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:32:25 PM UTC 2026
% Result : Unsatisfiable 0.14s 15.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 8 unt; 14 nHn; 33 RR)
% Number of literals : 93 ( 0 equ; 48 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_6,axiom,
( ~ big_f(X2)
| ~ big_f(X1)
| big_j(a,X2)
| big_g(X2)
| big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,axiom,
( ~ big_f(X1)
| big_g(X1)
| big_f(f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,axiom,
( ~ big_g(f(X1))
| ~ big_f(X1)
| big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_9,negated_conjecture,
~ big_g(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_4,axiom,
( ~ big_f(X1)
| big_f(a)
| big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_7,axiom,
( ~ big_j(X2,X1)
| ~ big_h(X1,X2)
| ~ big_f(X2)
| ~ big_f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
big_f(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_2,axiom,
( ~ big_f(X1)
| big_g(X1)
| big_h(f(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,axiom,
( ~ big_g(a)
| ~ big_f(X1)
| big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_9,plain,
( ~ big_f(X2)
| ~ big_f(X1)
| big_j(a,X2)
| big_g(X2)
| big_g(X1) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_10,plain,
( ~ big_f(X1)
| big_g(X1)
| big_f(f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_11,plain,
( ~ big_g(f(X1))
| ~ big_f(X1)
| big_g(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_12,plain,
( ~ big_f(X2)
| ~ big_f(X1)
| big_j(a,X2)
| big_g(X2)
| big_g(X1) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ big_f(X1)
| big_g(X1)
| big_f(f(X1)) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ big_g(f(X1))
| ~ big_f(X1)
| big_g(X1) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
~ big_g(b),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_16,plain,
( ~ big_f(X1)
| big_f(a)
| big_g(X1) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_17,plain,
( ~ big_j(X2,X1)
| ~ big_h(X1,X2)
| ~ big_f(X2)
| ~ big_f(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_18,plain,
( ~ big_f(X1)
| ~ big_f(X2)
| big_g(X2)
| big_g(X1)
| big_j(a,f(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
big_f(b),
clause_8 ).
cnf(c_0_20,negated_conjecture,
~ big_g(b),
c_0_15 ).
cnf(c_0_21,plain,
( ~ big_f(X1)
| big_f(a)
| big_g(X1) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ big_j(X2,X1)
| ~ big_h(X1,X2)
| ~ big_f(X2)
| ~ big_f(X1) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ big_f(X1)
| big_g(X1)
| big_j(a,f(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
big_f(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).
cnf(c_0_25,plain,
( ~ big_f(X1)
| big_g(X1)
| big_h(f(X1),X1) ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_26,plain,
( ~ big_g(a)
| ~ big_f(X1)
| big_g(X1) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_27,negated_conjecture,
( ~ big_f(X1)
| ~ big_h(f(X1),a)
| big_g(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_13]) ).
cnf(c_0_28,plain,
( ~ big_f(X1)
| big_g(X1)
| big_h(f(X1),X1) ),
c_0_25 ).
cnf(c_0_29,plain,
( ~ big_g(a)
| ~ big_f(X1)
| big_g(X1) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
big_g(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]) ).
cnf(c_0_31,plain,
( ~ big_f(X1)
| big_g(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN070-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.38 % Computer : n012.cluster.edu
% 0.09/15.38 % Model : x86_64 x86_64
% 0.09/15.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.38 % Memory : 8046.5625MB
% 0.09/15.38 % OS : Linux 6.8.0-71-generic
% 0.09/15.38 % CPULimit : 300
% 0.09/15.38 % WCLimit : 300
% 0.09/15.38 % DateTime : Mon Sep 21 10:42:23 UTC 2026
% 0.09/15.38 % CPUTime :
% 0.09/15.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/15.42 Running first-order theorem proving
% 0.14/15.42 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/15.45 % Version: 3.5.1
% 0.14/15.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/15.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/15.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/15.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/15.45 % Starting sh5l with 300s (1) cores
% 0.14/15.45 % sh5l with pid 2182761 completed with status 0
% 0.14/15.45 % Result found by sh5l
% 0.14/15.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/15.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/15.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/15.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/15.45 % Starting sh5l with 300s (1) cores
% 0.14/15.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/15.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/15.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/15.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/15.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/15.45 % SubtermCWHack with pid 2182769 completed with status 0
% 0.14/15.45 % Result found by SubtermCWHack
% 0.14/15.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/15.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/15.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/15.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/15.45 % Starting sh5l with 300s (1) cores
% 0.14/15.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/15.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/15.45 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/15.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/15.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/15.45 % Preprocessing time : 0.001 s
% 0.14/15.45
% 0.14/15.45 % Proof found!
% 0.14/15.45 % SZS status Unsatisfiable
% 0.14/15.45 % SZS output start CNFRefutation
% See solution above
% 0.14/15.45 % Parsed axioms : 9
% 0.14/15.45 % Removed by relevancy pruning/SinE : 0
% 0.14/15.45 % Initial clauses : 9
% 0.14/15.45 % Removed in clause preprocessing : 0
% 0.14/15.45 % Initial clauses in saturation : 9
% 0.14/15.45 % Processed clauses : 21
% 0.14/15.45 % ...of these trivial : 0
% 0.14/15.45 % ...subsumed : 0
% 0.14/15.45 % ...remaining for further processing : 21
% 0.14/15.45 % Other redundant clauses eliminated : 0
% 0.14/15.45 % Clauses deleted for lack of memory : 0
% 0.14/15.45 % Backward-subsumed : 7
% 0.14/15.45 % Backward-rewritten : 4
% 0.14/15.45 % Generated clauses : 18
% 0.14/15.45 % ...of the previous two non-redundant : 18
% 0.14/15.45 % ...aggressively subsumed : 0
% 0.14/15.45 % Contextual simplify-reflections : 3
% 0.14/15.45 % Paramodulations : 18
% 0.14/15.45 % Factorizations : 0
% 0.14/15.45 % NegExts : 0
% 0.14/15.45 % Equation resolutions : 0
% 0.14/15.45 % Disequality decompositions : 0
% 0.14/15.45 % Total rewrite steps : 11
% 0.14/15.45 % ...of those cached : 6
% 0.14/15.45 % Propositional unsat checks : 0
% 0.14/15.45 % Propositional check models : 0
% 0.14/15.45 % Propositional check unsatisfiable : 0
% 0.14/15.45 % Propositional clauses : 0
% 0.14/15.45 % Propositional clauses after purity: 0
% 0.14/15.45 % Propositional unsat core size : 0
% 0.14/15.45 % Propositional preprocessing time : 0.000
% 0.14/15.45 % Propositional encoding time : 0.000
% 0.14/15.45 % Propositional solver time : 0.000
% 0.14/15.45 % Success case prop preproc time : 0.000
% 0.14/15.45 % Success case prop encoding time : 0.000
% 0.14/15.45 % Success case prop solver time : 0.000
% 0.14/15.45 % Current number of processed clauses : 10
% 0.14/15.45 % Positive orientable unit clauses : 5
% 0.14/15.45 % Positive unorientable unit clauses: 0
% 0.14/15.45 % Negative unit clauses : 3
% 0.14/15.45 % Non-unit-clauses : 2
% 0.14/15.45 % Current number of unprocessed clauses: 1
% 0.14/15.45 % ...number of literals in the above : 6
% 0.14/15.45 % Current number of archived formulas : 0
% 0.14/15.45 % Current number of archived clauses : 11
% 0.14/15.45 % Clause-clause subsumption calls (NU) : 17
% 0.14/15.45 % Rec. Clause-clause subsumption calls : 15
% 0.14/15.45 % Non-unit clause-clause subsumptions : 10
% 0.14/15.45 % Unit Clause-clause subsumption calls : 2
% 0.14/15.45 % Rewrite failures with RHS unbound : 0
% 0.14/15.45 % BW rewrite match attempts : 4
% 0.14/15.45 % BW rewrite match successes : 4
% 0.14/15.45 % Condensation attempts : 0
% 0.14/15.45 % Condensation successes : 0
% 0.14/15.45 % Termbank termtop insertions : 606
% 0.14/15.45 % Search garbage collected termcells : 25
% 0.14/15.45
% 0.14/15.45 % -------------------------------------------------
% 0.14/15.45 % User time : 0.003 s
% 0.14/15.45 % System time : 0.001 s
% 0.14/15.45 % Total time : 0.004 s
% 0.14/15.45 % Maximum resident set size: 3888 pages
% 0.14/15.45
% 0.14/15.45 % -------------------------------------------------
% 0.14/15.45 % User time : 0.006 s
% 0.14/15.45 % System time : 0.003 s
% 0.14/15.45 % Total time : 0.009 s
% 0.14/15.45 % Maximum resident set size: 4864 pages
% 0.14/15.45 % E exiting
%------------------------------------------------------------------------------