%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN345+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 : n020.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:33:10 PM UTC 2026
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 79 ( 24 ~; 27 |; 8 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 14 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(church_46_16_4,conjecture,
! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X1,X2,X3)
=> big_f(X4,X3,X5) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,X3,X4)
=> big_f(X3,X5,X5) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(X3,X4,X5)
=> ( ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) )
& big_f(X2,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_4) ).
fof(c_0_1,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X1,X2,X3)
=> big_f(X4,X3,X5) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,X3,X4)
=> big_f(X3,X5,X5) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(X3,X4,X5)
=> ( ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) )
& big_f(X2,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[church_46_16_4]) ).
fof(c_0_2,negated_conjecture,
! [X8,X9] :
( ( ~ big_f(esk2_0,esk2_0,X8)
| big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) )
& ( ~ big_f(esk2_0,esk2_0,X8)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0) )
& big_f(X8,X9,esk3_2(X8,X9))
& ( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X8,esk3_2(X8,X9),esk3_2(X8,X9)) )
& ( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk2_0,X8,X9) )
& ( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(X9,X8,esk3_2(X8,X9)) )
& ( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_f(X1,X2,esk3_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(esk1_0,esk2_0,X1)
| big_f(esk1_0,esk2_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
big_f(esk1_0,esk2_0,esk2_0),
inference(ef,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk2_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
( big_f(esk2_0,X1,X2)
| big_f(esk1_0,esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X3)
| big_f(esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
big_f(esk2_0,X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2))
| big_f(esk1_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
~ big_f(esk1_0,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_9])]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN345+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.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 10:51:32 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % new_bool_3 with pid 2741698 completed with status 0
% 0.15/0.43 % Result found by new_bool_3
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 2741704 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Theorem
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 1
% 0.15/0.43 % Removed by relevancy pruning/SinE : 0
% 0.15/0.43 % Initial clauses : 7
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 7
% 0.15/0.43 % Processed clauses : 13
% 0.15/0.43 % ...of these trivial : 1
% 0.15/0.43 % ...subsumed : 0
% 0.15/0.43 % ...remaining for further processing : 12
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 4
% 0.15/0.43 % Backward-rewritten : 3
% 0.15/0.43 % Generated clauses : 8
% 0.15/0.43 % ...of the previous two non-redundant : 8
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 6
% 0.15/0.43 % Factorizations : 2
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 8
% 0.15/0.43 % ...of those cached : 4
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 5
% 0.15/0.43 % Positive orientable unit clauses : 3
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 2
% 0.15/0.43 % Non-unit-clauses : 0
% 0.15/0.43 % Current number of unprocessed clauses: 0
% 0.15/0.43 % ...number of literals in the above : 0
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 7
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 3
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 3
% 0.15/0.43 % Non-unit clause-clause subsumptions : 2
% 0.15/0.43 % Unit Clause-clause subsumption calls : 2
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 5
% 0.15/0.43 % BW rewrite match successes : 4
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 780
% 0.15/0.43 % Search garbage collected termcells : 186
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.003 s
% 0.15/0.43 % System time : 0.001 s
% 0.15/0.43 % Total time : 0.004 s
% 0.15/0.43 % Maximum resident set size: 3628 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.004 s
% 0.15/0.43 % System time : 0.006 s
% 0.15/0.43 % Total time : 0.010 s
% 0.15/0.43 % Maximum resident set size: 4608 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------