%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN084-2 : 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 : n001.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:05 PM UTC 2026
% Result : Unsatisfiable 0.14s 15.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of clauses : 34 ( 8 unt; 11 nHn; 30 RR)
% Number of literals : 78 ( 0 equ; 39 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pel62_2,negated_conjecture,
( ~ big_p(a)
| big_p(X1)
| big_p(f(f(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_2) ).
cnf(pel62_4,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(f(f(sk1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_4) ).
cnf(pel62_1,negated_conjecture,
big_p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_1) ).
cnf(pel62_7,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(sk2)
| big_p(f(sk2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_7) ).
cnf(pel62_6,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(sk1)
| big_p(f(sk1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_6) ).
cnf(pel62_3,negated_conjecture,
( ~ big_p(a)
| ~ big_p(f(X1))
| big_p(f(f(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_3) ).
cnf(pel62_5,negated_conjecture,
( ~ big_p(sk2)
| ~ big_p(sk1)
| big_p(f(sk2))
| big_p(f(sk1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_5) ).
cnf(c_0_7,negated_conjecture,
( ~ big_p(a)
| big_p(X1)
| big_p(f(f(X1))) ),
inference(fof_simplification,[status(thm)],[pel62_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(f(f(sk1))) ),
inference(fof_simplification,[status(thm)],[pel62_4]) ).
cnf(c_0_9,negated_conjecture,
( ~ big_p(a)
| big_p(X1)
| big_p(f(f(X1))) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
big_p(a),
pel62_1 ).
cnf(c_0_11,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(f(f(sk1))) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( big_p(X1)
| big_p(f(f(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(sk2)
| big_p(f(sk2)) ),
inference(fof_simplification,[status(thm)],[pel62_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(sk1)
| big_p(f(sk1)) ),
inference(fof_simplification,[status(thm)],[pel62_6]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_p(f(f(sk1)))
| big_p(sk2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(sk2)
| big_p(f(sk2)) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( ~ big_p(a)
| ~ big_p(f(X1))
| big_p(f(f(X1))) ),
inference(fof_simplification,[status(thm)],[pel62_3]) ).
cnf(c_0_18,negated_conjecture,
( ~ big_p(sk2)
| ~ big_p(sk1)
| big_p(f(sk2))
| big_p(f(sk1)) ),
inference(fof_simplification,[status(thm)],[pel62_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_p(f(f(sk2)))
| ~ big_p(sk1)
| big_p(f(sk1)) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
( big_p(sk2)
| big_p(sk1) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( ~ big_p(f(f(sk1)))
| big_p(f(sk2)) ),
inference(csr,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ big_p(a)
| ~ big_p(f(X1))
| big_p(f(f(X1))) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ big_p(sk2)
| ~ big_p(sk1)
| big_p(f(sk2))
| big_p(f(sk1)) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
( big_p(sk2)
| big_p(f(sk1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( big_p(sk1)
| big_p(f(sk2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( ~ big_p(f(X1))
| big_p(f(f(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_10])]) ).
cnf(c_0_27,negated_conjecture,
( big_p(f(sk1))
| big_p(f(sk2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
big_p(f(sk2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ big_p(f(f(sk1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
big_p(sk1),
inference(spm,[status(thm)],[c_0_29,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
~ big_p(f(sk1)),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ big_p(f(f(sk2))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_30])]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN084-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.39 % Computer : n001.cluster.edu
% 0.09/15.39 % Model : x86_64 x86_64
% 0.09/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.39 % Memory : 8046.5625MB
% 0.09/15.39 % OS : Linux 6.8.0-71-generic
% 0.09/15.39 % CPULimit : 300
% 0.09/15.39 % WCLimit : 300
% 0.09/15.39 % DateTime : Mon Sep 21 10:48:59 UTC 2026
% 0.09/15.39 % CPUTime :
% 0.09/15.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/15.44 Running first-order theorem proving
% 0.14/15.44 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 % new_bool_1 with pid 2924166 completed with status 0
% 0.14/15.45 % Result found by new_bool_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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/15.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 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 2924168 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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/15.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 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 : 7
% 0.14/15.45 % Removed by relevancy pruning/SinE : 0
% 0.14/15.45 % Initial clauses : 7
% 0.14/15.45 % Removed in clause preprocessing : 0
% 0.14/15.45 % Initial clauses in saturation : 7
% 0.14/15.45 % Processed clauses : 17
% 0.14/15.45 % ...of these trivial : 0
% 0.14/15.45 % ...subsumed : 0
% 0.14/15.45 % ...remaining for further processing : 17
% 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 : 4
% 0.14/15.45 % Backward-rewritten : 4
% 0.14/15.45 % Generated clauses : 12
% 0.14/15.45 % ...of the previous two non-redundant : 11
% 0.14/15.45 % ...aggressively subsumed : 0
% 0.14/15.45 % Contextual simplify-reflections : 6
% 0.14/15.45 % Paramodulations : 12
% 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 : 9
% 0.14/15.45 % ...of those cached : 5
% 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 : 9
% 0.14/15.45 % Positive orientable unit clauses : 4
% 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 : 3
% 0.14/15.45 % Current number of archived formulas : 0
% 0.14/15.45 % Current number of archived clauses : 8
% 0.14/15.45 % Clause-clause subsumption calls (NU) : 31
% 0.14/15.45 % Rec. Clause-clause subsumption calls : 26
% 0.14/15.45 % Non-unit clause-clause subsumptions : 6
% 0.14/15.45 % Unit Clause-clause subsumption calls : 9
% 0.14/15.45 % Rewrite failures with RHS unbound : 0
% 0.14/15.45 % BW rewrite match attempts : 3
% 0.14/15.45 % BW rewrite match successes : 3
% 0.14/15.45 % Condensation attempts : 0
% 0.14/15.45 % Condensation successes : 0
% 0.14/15.45 % Termbank termtop insertions : 352
% 0.14/15.45 % Search garbage collected termcells : 21
% 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: 3632 pages
% 0.14/15.45
% 0.14/15.45 % -------------------------------------------------
% 0.14/15.45 % User time : 0.005 s
% 0.14/15.45 % System time : 0.005 s
% 0.14/15.45 % Total time : 0.010 s
% 0.14/15.45 % Maximum resident set size: 4864 pages
% 0.14/15.45 % E exiting
%------------------------------------------------------------------------------