%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN077+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:23:03 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 78 ( 6 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 100 ( 45 ~; 41 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 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 : 51 ( 0 sgn 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel54,conjecture,
~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( ~ ? [X2] :
( big_f(X2,X1)
& big_f(X2,X5) )
& big_f(X1,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54) ).
fof(pel54_1,axiom,
! [X1] :
? [X2] :
! [X3] :
( big_f(X3,X2)
<=> X3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54_1) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( ~ ? [X2] :
( big_f(X2,X1)
& big_f(X2,X5) )
& big_f(X1,X5) ) ) ),
inference(assume_negation,[status(cth)],[pel54]) ).
fof(c_0_3,negated_conjecture,
! [X7,X8,X10,X12] :
( ( big_f(X7,esk1_0)
| ~ big_f(X12,esk3_1(X7))
| big_f(esk4_2(X7,X12),X12) )
& ( big_f(X7,esk1_0)
| ~ big_f(X12,esk3_1(X7))
| big_f(esk4_2(X7,X12),esk3_1(X7)) )
& ( big_f(X7,esk1_0)
| big_f(X7,esk3_1(X7)) )
& ( ~ big_f(X7,esk1_0)
| ~ big_f(X7,X8)
| ~ big_f(X10,esk2_2(X7,X8))
| ~ big_f(X10,X8) )
& ( ~ big_f(X7,esk1_0)
| ~ big_f(X7,X8)
| big_f(esk2_2(X7,X8),X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X14,X16,X17] :
( ( big_f(X17,esk5_1(X14))
| X17 != X14 )
& ( X16 = X14
| ~ big_f(X16,esk5_1(X14)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pel54_1])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(X3,esk1_0)
| ~ big_f(X3,X2)
| ~ big_f(X1,esk2_2(X3,X2))
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( ~ big_f(X2,esk3_1(X1))
| big_f(X1,esk1_0)
| big_f(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( ~ big_f(X1,esk5_1(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_f(X1,esk1_0)
| ~ big_f(X1,X2)
| big_f(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ big_f(X2,X3)
| ~ big_f(X2,esk1_0)
| ~ big_f(esk2_2(X2,X3),esk3_1(X1))
| ~ big_f(esk4_2(X1,esk2_2(X2,X3)),X3)
| big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_f(X2,esk3_1(X1))
| big_f(X1,esk1_0)
| big_f(esk4_2(X1,X2),esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ big_f(X1,esk1_0)
| ~ big_f(X1,esk5_1(X2))
| esk2_2(X1,esk5_1(X2)) = X2 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( X1 != X2
| big_f(X1,esk5_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ big_f(X2,esk1_0)
| ~ big_f(X2,esk3_1(X1))
| big_f(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_f(X3,X2)
| ~ big_f(X1,esk1_0)
| ~ big_f(X3,esk5_1(X2))
| ~ big_f(X1,esk5_1(X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
big_f(X1,esk5_1(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_f(X2,esk3_1(X1))
| ~ big_f(esk4_2(X1,X2),esk1_0)
| big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,esk1_0)
| ~ big_f(X1,esk5_1(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ big_f(esk1_0,esk3_1(X1))
| big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( big_f(X1,esk1_0)
| big_f(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ big_f(X1,X1)
| ~ big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
big_f(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN077+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/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:41:38 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % new_bool_3 with pid 568586 completed with status 0
% 0.10/0.42 % Result found by new_bool_3
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.10/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.42 % SubtermCWHack with pid 568592 completed with status 0
% 0.10/0.42 % Result found by SubtermCWHack
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.10/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.42 % Preprocessing time : 0.001 s
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Theorem
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 2
% 0.10/0.42 % Removed by relevancy pruning/SinE : 0
% 0.10/0.42 % Initial clauses : 7
% 0.10/0.42 % Removed in clause preprocessing : 0
% 0.10/0.42 % Initial clauses in saturation : 7
% 0.10/0.42 % Processed clauses : 39
% 0.10/0.42 % ...of these trivial : 0
% 0.10/0.42 % ...subsumed : 2
% 0.10/0.42 % ...remaining for further processing : 37
% 0.10/0.42 % Other redundant clauses eliminated : 1
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 1
% 0.10/0.42 % Backward-rewritten : 0
% 0.10/0.42 % Generated clauses : 52
% 0.10/0.42 % ...of the previous two non-redundant : 48
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 1
% 0.10/0.42 % Paramodulations : 51
% 0.10/0.42 % Factorizations : 0
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 1
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 3
% 0.10/0.42 % ...of those cached : 1
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 35
% 0.10/0.42 % Positive orientable unit clauses : 2
% 0.10/0.42 % Positive unorientable unit clauses: 0
% 0.10/0.42 % Negative unit clauses : 0
% 0.10/0.42 % Non-unit-clauses : 33
% 0.10/0.42 % Current number of unprocessed clauses: 16
% 0.10/0.42 % ...number of literals in the above : 44
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 1
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 182
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 118
% 0.10/0.42 % Non-unit clause-clause subsumptions : 4
% 0.10/0.42 % Unit Clause-clause subsumption calls : 0
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 0
% 0.10/0.42 % BW rewrite match successes : 0
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 1742
% 0.10/0.42 % Search garbage collected termcells : 180
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.003 s
% 0.10/0.42 % System time : 0.003 s
% 0.10/0.42 % Total time : 0.006 s
% 0.10/0.42 % Maximum resident set size: 3628 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.003 s
% 0.10/0.42 % System time : 0.008 s
% 0.10/0.42 % Total time : 0.011 s
% 0.10/0.42 % Maximum resident set size: 4864 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------