%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN006-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:21:44 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 14 unt; 6 nHn; 24 RR)
% Number of literals : 44 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,negated_conjecture,
~ q3(X1,g(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,negated_conjecture,
( ~ p2(X1,f(X2))
| q4(X1,f(X2))
| q3(f(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_1,negated_conjecture,
( ~ p1(X1,f(X2))
| q2(X1,f(X2))
| q1(f(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,negated_conjecture,
~ q2(X1,f(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_6,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
( ~ q1(X1,f(X2))
| p2(f(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_2,negated_conjecture,
p1(a,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(c_0_7,negated_conjecture,
~ q3(X1,g(X2)),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ p2(X1,f(X2))
| q4(X1,f(X2))
| q3(f(X1),X2) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_9,negated_conjecture,
( ~ p1(X1,f(X2))
| q2(X1,f(X2))
| q1(f(X1),X2) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_10,negated_conjecture,
~ q2(X1,f(X2)),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_11,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_12,negated_conjecture,
~ q3(X1,g(X2)),
c_0_7 ).
cnf(c_0_13,negated_conjecture,
( ~ p2(X1,f(X2))
| q4(X1,f(X2))
| q3(f(X1),X2) ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
( ~ q1(X1,f(X2))
| p2(f(X1),X2) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ p1(X1,f(X2))
| q2(X1,f(X2))
| q1(f(X1),X2) ),
c_0_9 ).
cnf(c_0_16,negated_conjecture,
~ q2(X1,f(X2)),
c_0_10 ).
cnf(c_0_17,negated_conjecture,
~ q4(f(f(X1)),f(g(f(X2)))),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
( ~ p2(X1,f(g(X2)))
| q4(X1,f(g(X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ q1(X1,f(X2))
| p2(f(X1),X2) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( ~ p1(X1,f(X2))
| q1(f(X1),X2) ),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ p2(f(f(X1)),f(g(f(X2)))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ p1(X1,f(f(X2)))
| p2(f(f(X1)),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
~ p1(X1,f(f(f(g(f(X2)))))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
p1(a,X1),
clause_2 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.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:38:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % sh5l with pid 560712 completed with status 0
% 0.13/0.45 % Result found by sh5l
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGUNF-FFSF11-MFFFFFNN
% 0.13/0.45 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 560720 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGUNF-FFSF11-MFFFFFNN
% 0.13/0.45 % partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 7
% 0.13/0.45 % Removed by relevancy pruning/SinE : 0
% 0.13/0.45 % Initial clauses : 7
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 7
% 0.13/0.45 % Processed clauses : 11
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 0
% 0.13/0.45 % ...remaining for further processing : 11
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 0
% 0.13/0.45 % Generated clauses : 5
% 0.13/0.45 % ...of the previous two non-redundant : 4
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 5
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 0
% 0.13/0.45 % ...of those cached : 0
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 11
% 0.13/0.45 % Positive orientable unit clauses : 1
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 5
% 0.13/0.45 % Non-unit-clauses : 5
% 0.13/0.45 % Current number of unprocessed clauses: 0
% 0.13/0.45 % ...number of literals in the above : 0
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 0
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.45 % Non-unit clause-clause subsumptions : 0
% 0.13/0.45 % Unit Clause-clause subsumption calls : 1
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 0
% 0.13/0.45 % BW rewrite match successes : 0
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 284
% 0.13/0.45 % Search garbage collected termcells : 14
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.002 s
% 0.13/0.45 % System time : 0.002 s
% 0.13/0.45 % Total time : 0.004 s
% 0.13/0.45 % Maximum resident set size: 3632 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.003 s
% 0.13/0.45 % System time : 0.007 s
% 0.13/0.45 % Total time : 0.010 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------