%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN313-1.001.002 : 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 : n005.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:37 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.60s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 30 ( 4 unt; 20 nHn; 17 RR)
% Number of literals : 83 ( 0 equ; 18 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 16 ( 4 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 55 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
( ~ p(X1,f1(X2),X3)
| ~ p(X1,f0(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause2,negated_conjecture,
( p(h2(X3),X2,j2(X2))
| p(h1(X1),X3,j1(X2))
| p(h0,X1,j0(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(c_0_2,negated_conjecture,
( ~ p(X1,f1(X2),X3)
| ~ p(X1,f0(X1),X2) ),
inference(fof_simplification,[status(thm)],[clause1]) ).
cnf(c_0_3,negated_conjecture,
( ~ p(X1,f1(X2),X3)
| ~ p(X1,f0(X1),X2) ),
c_0_2 ).
cnf(c_0_4,negated_conjecture,
( p(h2(X3),X2,j2(X2))
| p(h1(X1),X3,j1(X2))
| p(h0,X1,j0(X2)) ),
clause2 ).
cnf(c_0_5,negated_conjecture,
( ~ p(h1(X1),f1(j1(X2)),X3)
| p(h0,X1,j0(X2))
| p(h2(f0(h1(X1))),X2,j2(X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( p(h0,X3,j0(X1))
| p(h0,X3,j0(X2))
| p(h2(f0(h1(X3))),X1,j2(X1))
| p(h2(f1(j1(X1))),X2,j2(X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ p(h2(f1(j1(X2))),f1(j2(f0(h2(f1(j1(X2)))))),X3)
| p(h0,X1,j0(X2))
| p(h2(f0(h1(X1))),X2,j2(X2))
| p(h0,X1,j0(f0(h2(f1(j1(X2)))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( p(h0,X3,j0(X2))
| p(h0,X1,j0(X2))
| p(h2(f0(h1(X3))),X2,j2(X2))
| p(h2(f0(h1(X1))),X2,j2(X2))
| p(h0,X3,j0(f0(h2(f1(j1(X2))))))
| p(h0,X1,j0(f1(j2(f0(h2(f1(j1(X2)))))))) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( p(h0,X1,j0(X2))
| p(h2(f0(h1(X1))),X2,j2(X2))
| p(h0,X1,j0(f0(h2(f1(j1(X2))))))
| p(h0,X1,j0(f1(j2(f0(h2(f1(j1(X2)))))))) ),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( ~ p(h0,f1(j0(f1(j2(f0(h2(f1(j1(X1)))))))),X2)
| p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1))
| p(h0,f0(h0),j0(f0(h2(f1(j1(X1)))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1))
| p(h0,f0(h0),j0(f0(h2(f1(j1(X1))))))
| p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f1(j1(X1))))))))))),X2,j2(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_10]),c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( ~ p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f1(j1(X1))))))))))),f1(j2(f0(h2(f0(h1(f1(j0(f1(j2(f0(h2(f1(j1(X1)))))))))))))),X2)
| p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1))
| p(h0,f0(h0),j0(f0(h2(f1(j1(X1)))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1))
| p(h0,f0(h0),j0(f0(h2(f1(j1(X1)))))) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ p(h0,f1(j0(f0(h2(f1(j1(X1)))))),X2)
| p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1))
| p(h2(f0(h1(f1(j0(f0(h2(f1(j1(X1))))))))),X2,j2(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_14]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( ~ p(h2(f0(h1(f1(j0(f0(h2(f1(j1(X1))))))))),f1(j2(f0(h2(f0(h1(f1(j0(f0(h2(f1(j1(X1)))))))))))),X2)
| p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( p(h0,f0(h0),j0(X1))
| p(h2(f0(h1(f0(h0)))),X1,j2(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ p(h2(f0(h1(f0(h0)))),f1(j2(f0(h2(f0(h1(f0(h0))))))),X1)
| p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0))))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0)))))))
| p(h0,f0(h0),j0(f1(j2(f0(h2(f0(h1(f0(h0))))))))) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ p(h0,f1(j0(f1(j2(f0(h2(f0(h1(f0(h0))))))))),X1)
| p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0))))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( p(h2(f1(j1(X1))),X2,j2(X2))
| p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0)))))))
| p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))))),X1,j2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_6]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( ~ p(h2(f1(j1(X1))),f1(j2(f0(h2(f1(j1(X1)))))),X2)
| p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0)))))))
| p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))))),X1,j2(X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0)))))))
| p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))))),X1,j2(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ p(h2(f0(h1(f1(j0(f1(j2(f0(h2(f0(h1(f0(h0)))))))))))),f1(j2(f0(h2(f0(h1(f1(j0(f1(j2(f0(h2(f0(h1(f0(h0))))))))))))))),X1)
| p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0))))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
p(h0,f0(h0),j0(f0(h2(f0(h1(f0(h0))))))),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ p(h0,f1(j0(f0(h2(f0(h1(f0(h0))))))),X1),
inference(spm,[status(thm)],[c_0_3,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( ~ p(h2(f0(h1(X1))),f1(j2(f0(h2(f0(h1(X1)))))),X2)
| p(h0,X1,j0(f0(h2(f0(h1(X1))))))
| p(h0,X1,j0(f0(h2(f1(j1(f0(h2(f0(h1(X1))))))))))
| p(h0,X1,j0(f1(j2(f0(h2(f1(j1(f0(h2(f0(h1(X1)))))))))))) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_28,negated_conjecture,
p(h2(f0(h1(f1(j0(f0(h2(f0(h1(f0(h0)))))))))),X1,j2(X1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_9]),c_0_26]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_26]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN313-1.001.002 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.52 % Computer : n005.cluster.edu
% 0.10/0.52 % Model : x86_64 x86_64
% 0.10/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52 % Memory : 8046.5625MB
% 0.10/0.52 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Mon Sep 21 10:48:33 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.57 Running first-order theorem proving
% 0.16/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.16/0.60 % Version: 3.5.1
% 0.16/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.60 % Starting sh5l with 300s (1) cores
% 0.16/0.60 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3276091 completed with status 0
% 0.16/0.60 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.60 % No SInE strategy applied
% 0.16/0.60 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.16/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.60 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.60 % SubtermCWHack with pid 3276095 completed with status 0
% 0.16/0.60 % Result found by SubtermCWHack
% 0.16/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.60 % No SInE strategy applied
% 0.16/0.60 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.16/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.60 % Preprocessing time : 0.001 s
% 0.16/0.60
% 0.16/0.60 % Proof found!
% 0.16/0.60 % SZS status Unsatisfiable
% 0.16/0.60 % SZS output start CNFRefutation
% See solution above
% 0.16/0.60 % Parsed axioms : 2
% 0.16/0.60 % Removed by relevancy pruning/SinE : 0
% 0.16/0.60 % Initial clauses : 2
% 0.16/0.60 % Removed in clause preprocessing : 0
% 0.16/0.60 % Initial clauses in saturation : 2
% 0.16/0.60 % Processed clauses : 90
% 0.16/0.60 % ...of these trivial : 0
% 0.16/0.60 % ...subsumed : 19
% 0.16/0.60 % ...remaining for further processing : 71
% 0.16/0.60 % Other redundant clauses eliminated : 0
% 0.16/0.60 % Clauses deleted for lack of memory : 0
% 0.16/0.60 % Backward-subsumed : 27
% 0.16/0.60 % Backward-rewritten : 6
% 0.16/0.60 % Generated clauses : 476
% 0.16/0.60 % ...of the previous two non-redundant : 473
% 0.16/0.60 % ...aggressively subsumed : 0
% 0.16/0.60 % Contextual simplify-reflections : 7
% 0.16/0.60 % Paramodulations : 466
% 0.16/0.60 % Factorizations : 10
% 0.16/0.60 % NegExts : 0
% 0.16/0.60 % Equation resolutions : 0
% 0.16/0.60 % Disequality decompositions : 0
% 0.16/0.60 % Total rewrite steps : 6
% 0.16/0.60 % ...of those cached : 5
% 0.16/0.60 % Propositional unsat checks : 0
% 0.16/0.60 % Propositional check models : 0
% 0.16/0.60 % Propositional check unsatisfiable : 0
% 0.16/0.60 % Propositional clauses : 0
% 0.16/0.60 % Propositional clauses after purity: 0
% 0.16/0.60 % Propositional unsat core size : 0
% 0.16/0.60 % Propositional preprocessing time : 0.000
% 0.16/0.60 % Propositional encoding time : 0.000
% 0.16/0.60 % Propositional solver time : 0.000
% 0.16/0.60 % Success case prop preproc time : 0.000
% 0.16/0.60 % Success case prop encoding time : 0.000
% 0.16/0.60 % Success case prop solver time : 0.000
% 0.16/0.60 % Current number of processed clauses : 38
% 0.16/0.60 % Positive orientable unit clauses : 2
% 0.16/0.60 % Positive unorientable unit clauses: 0
% 0.16/0.60 % Negative unit clauses : 1
% 0.16/0.60 % Non-unit-clauses : 35
% 0.16/0.60 % Current number of unprocessed clauses: 382
% 0.16/0.60 % ...number of literals in the above : 2631
% 0.16/0.60 % Current number of archived formulas : 0
% 0.16/0.60 % Current number of archived clauses : 33
% 0.16/0.60 % Clause-clause subsumption calls (NU) : 2208
% 0.16/0.60 % Rec. Clause-clause subsumption calls : 308
% 0.16/0.60 % Non-unit clause-clause subsumptions : 53
% 0.16/0.60 % Unit Clause-clause subsumption calls : 55
% 0.16/0.60 % Rewrite failures with RHS unbound : 0
% 0.16/0.60 % BW rewrite match attempts : 11
% 0.16/0.60 % BW rewrite match successes : 1
% 0.16/0.60 % Condensation attempts : 0
% 0.16/0.60 % Condensation successes : 0
% 0.16/0.60 % Termbank termtop insertions : 39264
% 0.16/0.60 % Search garbage collected termcells : 5
% 0.16/0.60
% 0.16/0.60 % -------------------------------------------------
% 0.16/0.60 % User time : 0.012 s
% 0.16/0.60 % System time : 0.005 s
% 0.16/0.60 % Total time : 0.017 s
% 0.16/0.60 % Maximum resident set size: 3628 pages
% 0.16/0.60
% 0.16/0.60 % -------------------------------------------------
% 0.16/0.60 % User time : 0.065 s
% 0.16/0.60 % System time : 0.015 s
% 0.16/0.60 % Total time : 0.080 s
% 0.16/0.60 % Maximum resident set size: 4864 pages
% 0.16/0.60 % E exiting
%------------------------------------------------------------------------------