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