%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO085+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 12:27:08 PM UTC 2026
% Result : Theorem 0.25s 0.77s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 48 ( 11 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 53 ( 23 ~; 13 |; 11 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 15 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_2_7_1,conjecture,
! [X1] :
( open(X1)
=> ? [X3,X5] :
( end_point(X5,X1)
& end_point(X3,X1)
& X3 != X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1) ).
fof(open_defn,axiom,
! [X1] :
( open(X1)
<=> ? [X3] : end_point(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',open_defn) ).
fof(c6,axiom,
! [X1,X3] :
( end_point(X3,X1)
=> ? [X5] :
( X3 != X5
& end_point(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c6) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( open(X1)
=> ? [X3,X5] :
( end_point(X5,X1)
& end_point(X3,X1)
& X3 != X5 ) ),
inference(assume_negation,[status(cth)],[theorem_2_7_1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( open(X1)
=> ? [X3,X5] :
( end_point(X5,X1)
& end_point(X3,X1)
& X3 != X5 ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10] :
( ( ~ end_point(X10,esk1_0)
| ~ end_point(X9,esk1_0)
| X9 = X10 )
& open(esk1_0) ),
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_4])])])])]) ).
fof(c_0_6,plain,
! [X18,X20,X21] :
( ( open(X20)
| ~ end_point(X21,X20) )
& ( end_point(esk3_1(X18),X18)
| ~ open(X18) ) ),
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)],[open_defn])])])])])]) ).
fof(c_0_7,plain,
! [X1,X3] :
( end_point(X3,X1)
=> ? [X5] :
( X3 != X5
& end_point(X5,X1) ) ),
inference(fof_simplification,[status(thm)],[c6]) ).
cnf(c_0_8,negated_conjecture,
( ~ end_point(X2,esk1_0)
| ~ end_point(X1,esk1_0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ open(X1)
| end_point(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
open(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X15,X16] :
( ( ~ end_point(X16,X15)
| X16 != esk2_2(X15,X16) )
& ( ~ end_point(X16,X15)
| end_point(esk2_2(X15,X16),X15) ) ),
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_7])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ end_point(X1,esk1_0)
| X1 = esk3_1(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ end_point(X2,X1)
| end_point(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ end_point(X1,X2)
| X1 != esk2_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ end_point(X1,esk1_0)
| esk2_2(esk1_0,X1) = esk3_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ end_point(esk3_1(esk1_0),esk1_0),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.66 % Computer : n017.cluster.edu
% 0.19/0.66 % Model : x86_64 x86_64
% 0.19/0.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.66 % Memory : 8046.5625MB
% 0.19/0.66 % OS : Linux 6.8.0-71-generic
% 0.19/0.66 % CPULimit : 300
% 0.19/0.66 % WCLimit : 300
% 0.19/0.66 % DateTime : Sun Sep 20 10:16:58 UTC 2026
% 0.19/0.66 % CPUTime :
% 0.19/0.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.73 Running first-order theorem proving
% 0.25/0.73 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.25/0.77 % Version: 3.5.1
% 0.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.77 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.77 % Starting sh5l with 300s (1) cores
% 0.25/0.77 % new_bool_3 with pid 3951155 completed with status 0
% 0.25/0.77 % Result found by new_bool_3
% 0.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.77 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.25/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.77 % SubtermCWHack with pid 3951158 completed with status 0
% 0.25/0.77 % Result found by SubtermCWHack
% 0.25/0.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.77 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.25/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.77 % Preprocessing time : 0.003 s
% 0.25/0.77
% 0.25/0.77 % Proof found!
% 0.25/0.77 % SZS status Theorem
% 0.25/0.77 % SZS output start CNFRefutation
% See solution above
% 0.25/0.77 % Parsed axioms : 17
% 0.25/0.77 % Removed by relevancy pruning/SinE : 6
% 0.25/0.77 % Initial clauses : 35
% 0.25/0.77 % Removed in clause preprocessing : 0
% 0.25/0.77 % Initial clauses in saturation : 35
% 0.25/0.77 % Processed clauses : 20
% 0.25/0.77 % ...of these trivial : 0
% 0.25/0.77 % ...subsumed : 1
% 0.25/0.77 % ...remaining for further processing : 19
% 0.25/0.77 % Other redundant clauses eliminated : 1
% 0.25/0.77 % Clauses deleted for lack of memory : 0
% 0.25/0.77 % Backward-subsumed : 0
% 0.25/0.77 % Backward-rewritten : 0
% 0.25/0.77 % Generated clauses : 18
% 0.25/0.77 % ...of the previous two non-redundant : 14
% 0.25/0.77 % ...aggressively subsumed : 0
% 0.25/0.77 % Contextual simplify-reflections : 0
% 0.25/0.77 % Paramodulations : 17
% 0.25/0.77 % Factorizations : 0
% 0.25/0.77 % NegExts : 0
% 0.25/0.77 % Equation resolutions : 1
% 0.25/0.77 % Disequality decompositions : 0
% 0.25/0.77 % Total rewrite steps : 4
% 0.25/0.77 % ...of those cached : 3
% 0.25/0.77 % Propositional unsat checks : 0
% 0.25/0.77 % Propositional check models : 0
% 0.25/0.77 % Propositional check unsatisfiable : 0
% 0.25/0.77 % Propositional clauses : 0
% 0.25/0.77 % Propositional clauses after purity: 0
% 0.25/0.77 % Propositional unsat core size : 0
% 0.25/0.77 % Propositional preprocessing time : 0.000
% 0.25/0.77 % Propositional encoding time : 0.000
% 0.25/0.77 % Propositional solver time : 0.000
% 0.25/0.77 % Success case prop preproc time : 0.000
% 0.25/0.77 % Success case prop encoding time : 0.000
% 0.25/0.77 % Success case prop solver time : 0.000
% 0.25/0.77 % Current number of processed clauses : 19
% 0.25/0.77 % Positive orientable unit clauses : 2
% 0.25/0.77 % Positive unorientable unit clauses: 0
% 0.25/0.77 % Negative unit clauses : 1
% 0.25/0.77 % Non-unit-clauses : 16
% 0.25/0.77 % Current number of unprocessed clauses: 28
% 0.25/0.77 % ...number of literals in the above : 104
% 0.25/0.77 % Current number of archived formulas : 0
% 0.25/0.77 % Current number of archived clauses : 0
% 0.25/0.77 % Clause-clause subsumption calls (NU) : 35
% 0.25/0.77 % Rec. Clause-clause subsumption calls : 31
% 0.25/0.77 % Non-unit clause-clause subsumptions : 1
% 0.25/0.77 % Unit Clause-clause subsumption calls : 3
% 0.25/0.77 % Rewrite failures with RHS unbound : 0
% 0.25/0.77 % BW rewrite match attempts : 2
% 0.25/0.77 % BW rewrite match successes : 0
% 0.25/0.77 % Condensation attempts : 0
% 0.25/0.77 % Condensation successes : 0
% 0.25/0.77 % Termbank termtop insertions : 2988
% 0.25/0.77 % Search garbage collected termcells : 891
% 0.25/0.77
% 0.25/0.77 % -------------------------------------------------
% 0.25/0.77 % User time : 0.012 s
% 0.25/0.77 % System time : 0.003 s
% 0.25/0.77 % Total time : 0.015 s
% 0.25/0.77 % Maximum resident set size: 3660 pages
% 0.25/0.77
% 0.25/0.77 % -------------------------------------------------
% 0.25/0.77 % User time : 0.014 s
% 0.25/0.77 % System time : 0.006 s
% 0.25/0.77 % Total time : 0.021 s
% 0.25/0.77 % Maximum resident set size: 4864 pages
% 0.25/0.77 % E exiting
%------------------------------------------------------------------------------