%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN074+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 : n006.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:02 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 56 ( 36 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 57 ( 20 ~; 26 |; 6 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel51,conjecture,
? [X1] :
! [X3] :
( ? [X2] :
! [X4] :
( big_f(X3,X4)
<=> X4 = X2 )
<=> X3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51) ).
fof(pel51_1,axiom,
? [X1,X2] :
! [X3,X4] :
( big_f(X3,X4)
<=> ( X4 = X2
& X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel51_1) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
! [X3] :
( ? [X2] :
! [X4] :
( big_f(X3,X4)
<=> X4 = X2 )
<=> X3 = X1 ),
inference(assume_negation,[status(cth)],[pel51]) ).
fof(c_0_3,negated_conjecture,
! [X5,X7,X10,X11] :
( ( esk1_1(X5) = X5
| big_f(esk1_1(X5),X11)
| X11 != esk3_1(X5) )
& ( esk1_1(X5) = X5
| X10 = esk3_1(X5)
| ~ big_f(esk1_1(X5),X10) )
& ( esk1_1(X5) != X5
| esk2_2(X5,X7) = X7
| big_f(esk1_1(X5),esk2_2(X5,X7)) )
& ( esk1_1(X5) != X5
| esk2_2(X5,X7) != X7
| ~ big_f(esk1_1(X5),esk2_2(X5,X7)) ) ),
inference(distribute,[status(thm)],[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)],[c_0_2])])])])])])]) ).
fof(c_0_4,plain,
! [X14,X15] :
( ( big_f(X14,X15)
| X15 != esk5_0
| X14 != esk4_0 )
& ( ~ big_f(X14,X15)
| X15 = esk5_0 )
& ( ~ big_f(X14,X15)
| X14 = esk4_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel51_1])])])])]) ).
cnf(c_0_5,negated_conjecture,
( X1 != esk3_1(X2)
| esk1_1(X2) = X2
| big_f(esk1_1(X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ~ big_f(X1,X2)
| X1 = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(esk1_1(X1),esk3_1(X1))
| esk1_1(X1) = X1 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( esk1_1(X1) = X1
| esk1_1(X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( esk1_1(X1) != X1
| esk2_2(X1,X2) = X2
| big_f(esk1_1(X1),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
esk1_1(esk4_0) = esk4_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_8])]) ).
cnf(c_0_11,plain,
( ~ big_f(X2,X1)
| X1 = esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( big_f(esk4_0,esk2_2(esk4_0,X1))
| esk2_2(esk4_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( esk2_2(esk4_0,X1) = X1
| esk2_2(esk4_0,X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( X2 != esk5_0
| X1 != esk4_0
| big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( esk1_1(X1) != X1
| esk2_2(X1,X2) != X2
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
esk2_2(esk4_0,esk5_0) = esk5_0,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_13])]) ).
cnf(c_0_17,plain,
big_f(esk4_0,esk5_0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10]),c_0_10]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN074+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n006.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 10:41:59 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.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.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % new_bool_3 with pid 2652469 completed with status 0
% 0.12/0.43 % Result found by new_bool_3
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 2652475 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 2
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 7
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 7
% 0.12/0.44 % Processed clauses : 23
% 0.12/0.44 % ...of these trivial : 1
% 0.12/0.44 % ...subsumed : 4
% 0.12/0.44 % ...remaining for further processing : 18
% 0.12/0.44 % Other redundant clauses eliminated : 10
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 42
% 0.12/0.44 % ...of the previous two non-redundant : 26
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 29
% 0.12/0.44 % Factorizations : 4
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 10
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 17
% 0.12/0.44 % ...of those cached : 15
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 16
% 0.12/0.44 % Positive orientable unit clauses : 3
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 0
% 0.12/0.44 % Non-unit-clauses : 13
% 0.12/0.44 % Current number of unprocessed clauses: 10
% 0.12/0.44 % ...number of literals in the above : 27
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 0
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 11
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 9
% 0.12/0.44 % Non-unit clause-clause subsumptions : 4
% 0.12/0.44 % Unit Clause-clause subsumption calls : 0
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 0
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 887
% 0.12/0.44 % Search garbage collected termcells : 209
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.005 s
% 0.12/0.44 % System time : 0.001 s
% 0.12/0.44 % Total time : 0.006 s
% 0.12/0.44 % Maximum resident set size: 3576 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.007 s
% 0.12/0.44 % System time : 0.005 s
% 0.12/0.44 % Total time : 0.012 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------