%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN920+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:30:43 PM UTC 2026
% Result : Theorem 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 110 ( 32 ~; 31 |; 26 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ( ! [X1] :
( ( g(X1)
& f(X1) )
=> h(X1) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ( ! [X1] :
( ( g(X1)
& f(X1) )
=> h(X1) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
~ ( ( ( ! [X3] :
( f(X3)
=> h(X3) )
| ! [X2] :
( f(X2)
=> g(X2) ) )
& ( ! [X1] :
( ( g(X1)
& f(X1) )
=> h(X1) )
=> ? [X1] :
( ~ g(X1)
& f(X1) ) ) )
=> ( ! [X4] :
( ( h(X4)
& f(X4) )
=> g(X4) )
=> ? [X5] :
( ~ h(X5)
& g(X5)
& f(X5) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X8,X9,X10,X11] :
( ( h(X11)
| ~ g(X11)
| ~ f(X11) )
& ( g(X10)
| ~ h(X10)
| ~ f(X10) )
& ( h(X9)
| ~ f(X9)
| g(X8)
| ~ f(X8) )
& ( ~ h(esk1_0)
| ~ g(esk2_0) )
& ( ~ h(esk1_0)
| f(esk2_0) )
& ( g(esk1_0)
| ~ g(esk2_0) )
& ( g(esk1_0)
| f(esk2_0) )
& ( f(esk1_0)
| ~ g(esk2_0) )
& ( f(esk1_0)
| 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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ h(esk1_0)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ g(X1)
| ~ f(X1)
| h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( f(esk1_0)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( g(esk1_0)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| h(X2)
| g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
f(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ h(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ g(esk2_0)
| f(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ g(esk2_0)
| g(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ f(X1)
| g(X1)
| h(esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ g(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_5]),c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ h(X1)
| ~ f(X1)
| g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
h(esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN920+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n018.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 11:31:59 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.40 % Version: 3.5.1
% 0.12/0.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.40 % Starting sh5l with 300s (1) cores
% 0.12/0.40 % new_bool_3 with pid 1760892 completed with status 0
% 0.12/0.40 % Result found by new_bool_3
% 0.12/0.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.40 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.40 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.12/0.40 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.40 % SubtermCWHack with pid 1760898 completed with status 0
% 0.12/0.40 % Result found by SubtermCWHack
% 0.12/0.40 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.40 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.40 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.12/0.40 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.40 % Preprocessing time : 0.001 s
% 0.12/0.40
% 0.12/0.40 % Proof found!
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start CNFRefutation
% See solution above
% 0.12/0.40 % Parsed axioms : 1
% 0.12/0.40 % Removed by relevancy pruning/SinE : 0
% 0.12/0.40 % Initial clauses : 9
% 0.12/0.40 % Removed in clause preprocessing : 0
% 0.12/0.40 % Initial clauses in saturation : 9
% 0.12/0.40 % Processed clauses : 13
% 0.12/0.40 % ...of these trivial : 0
% 0.12/0.40 % ...subsumed : 0
% 0.12/0.40 % ...remaining for further processing : 13
% 0.12/0.40 % Other redundant clauses eliminated : 0
% 0.12/0.40 % Clauses deleted for lack of memory : 0
% 0.12/0.40 % Backward-subsumed : 3
% 0.12/0.40 % Backward-rewritten : 4
% 0.12/0.40 % Generated clauses : 6
% 0.12/0.40 % ...of the previous two non-redundant : 4
% 0.12/0.40 % ...aggressively subsumed : 0
% 0.12/0.40 % Contextual simplify-reflections : 4
% 0.12/0.40 % Paramodulations : 6
% 0.12/0.40 % Factorizations : 0
% 0.12/0.40 % NegExts : 0
% 0.12/0.40 % Equation resolutions : 0
% 0.12/0.40 % Disequality decompositions : 0
% 0.12/0.40 % Total rewrite steps : 5
% 0.12/0.40 % ...of those cached : 3
% 0.12/0.40 % Propositional unsat checks : 0
% 0.12/0.40 % Propositional check models : 0
% 0.12/0.40 % Propositional check unsatisfiable : 0
% 0.12/0.40 % Propositional clauses : 0
% 0.12/0.40 % Propositional clauses after purity: 0
% 0.12/0.40 % Propositional unsat core size : 0
% 0.12/0.40 % Propositional preprocessing time : 0.000
% 0.12/0.40 % Propositional encoding time : 0.000
% 0.12/0.40 % Propositional solver time : 0.000
% 0.12/0.40 % Success case prop preproc time : 0.000
% 0.12/0.40 % Success case prop encoding time : 0.000
% 0.12/0.40 % Success case prop solver time : 0.000
% 0.12/0.40 % Current number of processed clauses : 6
% 0.12/0.40 % Positive orientable unit clauses : 2
% 0.12/0.40 % Positive unorientable unit clauses: 0
% 0.12/0.40 % Negative unit clauses : 1
% 0.12/0.40 % Non-unit-clauses : 3
% 0.12/0.40 % Current number of unprocessed clauses: 0
% 0.12/0.40 % ...number of literals in the above : 0
% 0.12/0.40 % Current number of archived formulas : 0
% 0.12/0.40 % Current number of archived clauses : 7
% 0.12/0.40 % Clause-clause subsumption calls (NU) : 9
% 0.12/0.40 % Rec. Clause-clause subsumption calls : 9
% 0.12/0.40 % Non-unit clause-clause subsumptions : 4
% 0.12/0.40 % Unit Clause-clause subsumption calls : 3
% 0.12/0.40 % Rewrite failures with RHS unbound : 0
% 0.12/0.40 % BW rewrite match attempts : 2
% 0.12/0.40 % BW rewrite match successes : 2
% 0.12/0.40 % Condensation attempts : 0
% 0.12/0.40 % Condensation successes : 0
% 0.12/0.40 % Termbank termtop insertions : 750
% 0.12/0.40 % Search garbage collected termcells : 225
% 0.12/0.40
% 0.12/0.40 % -------------------------------------------------
% 0.12/0.40 % User time : 0.001 s
% 0.12/0.40 % System time : 0.004 s
% 0.12/0.40 % Total time : 0.005 s
% 0.12/0.40 % Maximum resident set size: 3632 pages
% 0.12/0.40
% 0.12/0.40 % -------------------------------------------------
% 0.12/0.40 % User time : 0.004 s
% 0.12/0.40 % System time : 0.005 s
% 0.12/0.40 % Total time : 0.009 s
% 0.12/0.40 % Maximum resident set size: 4864 pages
% 0.12/0.40 % E exiting
%------------------------------------------------------------------------------