%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO465+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:30:14 PM UTC 2026
% Result : Theorem 141.58s 22.16s
% Output : CNFRefutation 141.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 11 unt; 0 def)
% Number of atoms : 29 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 10 ~; 6 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 33 ( 1 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSPANu_NEG,conjecture,
! [X1400,X1,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),X1))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),i(s(fun(cart(real,X1400),cart(real,X1400)),vectoru_neg),s(cart(real,X1400),X1))))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97)))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSPANu_NEG) ).
fof(aIN,axiom,
! [X4,X7,X1] : s(bool,i(s(fun(fun(X4,bool),bool),i(s(fun(X4,fun(fun(X4,bool),bool)),in),s(X4,X1))),s(fun(X4,bool),X7))) = s(bool,i(s(fun(X4,bool),X7),s(X4,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/GEO010+0.ax',aIN) ).
fof(aSUBSPACEu_NEG,axiom,
! [X1369,X1,X97] :
( ( p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),i(s(fun(cart(real,X1369),fun(fun(cart(real,X1369),bool),bool)),in),s(cart(real,X1369),X1))),s(fun(cart(real,X1369),bool),X97))))
& p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),subspace),s(fun(cart(real,X1369),bool),X97)))) )
=> p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),i(s(fun(cart(real,X1369),fun(fun(cart(real,X1369),bool),bool)),in),s(cart(real,X1369),i(s(fun(cart(real,X1369),cart(real,X1369)),vectoru_neg),s(cart(real,X1369),X1))))),s(fun(cart(real,X1369),bool),X97)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSUBSPACEu_NEG) ).
fof(aSUBSPACEu_SPAN,axiom,
! [X1383,X97] : p(s(bool,i(s(fun(fun(cart(real,X1383),bool),bool),subspace),s(fun(cart(real,X1383),bool),i(s(fun(fun(cart(real,X1383),bool),fun(cart(real,X1383),bool)),span),s(fun(cart(real,X1383),bool),X97)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSUBSPACEu_SPAN) ).
fof(c_0_4,negated_conjecture,
~ ! [X1400,X1,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),X1))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),i(s(fun(cart(real,X1400),cart(real,X1400)),vectoru_neg),s(cart(real,X1400),X1))))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97)))))) ),
inference(assume_negation,[status(cth)],[aSPANu_NEG]) ).
fof(c_0_5,negated_conjecture,
( ~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),vectoru_neg),s(cart(real,esk1_0),esk2_0))))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_0))))))
& p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_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_6,plain,
! [X2203,X2204,X2205] : s(bool,i(s(fun(fun(X2203,bool),bool),i(s(fun(X2203,fun(fun(X2203,bool),bool)),in),s(X2203,X2205))),s(fun(X2203,bool),X2204))) = s(bool,i(s(fun(X2203,bool),X2204),s(X2203,X2205))),
inference(variable_rename,[status(thm)],[aIN]) ).
fof(c_0_7,plain,
! [X2277,X2278,X2279] :
( p(s(bool,i(s(fun(fun(cart(real,X2277),bool),bool),i(s(fun(cart(real,X2277),fun(fun(cart(real,X2277),bool),bool)),in),s(cart(real,X2277),i(s(fun(cart(real,X2277),cart(real,X2277)),vectoru_neg),s(cart(real,X2277),X2278))))),s(fun(cart(real,X2277),bool),X2279))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2277),bool),bool),i(s(fun(cart(real,X2277),fun(fun(cart(real,X2277),bool),bool)),in),s(cart(real,X2277),X2278))),s(fun(cart(real,X2277),bool),X2279))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2277),bool),bool),subspace),s(fun(cart(real,X2277),bool),X2279)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aSUBSPACEu_NEG])])]) ).
cnf(c_0_8,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),vectoru_neg),s(cart(real,esk1_0),esk2_0))))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_0)))))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(X1,fun(fun(X1,bool),bool)),in),s(X1,X2))),s(fun(X1,bool),X3))) = s(bool,i(s(fun(X1,bool),X3),s(X1,X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),bool)),in),s(cart(real,X1),X3))),s(fun(cart(real,X1),bool),X2))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2))))
| p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),bool)),in),s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),vectoru_neg),s(cart(real,X1),X3))))),s(fun(cart(real,X1),bool),X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X2094,X2095] : p(s(bool,i(s(fun(fun(cart(real,X2094),bool),bool),subspace),s(fun(cart(real,X2094),bool),i(s(fun(fun(cart(real,X2094),bool),fun(cart(real,X2094),bool)),span),s(fun(cart(real,X2094),bool),X2095)))))),
inference(variable_rename,[status(thm)],[aSUBSPACEu_SPAN]) ).
cnf(c_0_12,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),esk2_0))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_0)))))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_0))),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),vectoru_neg),s(cart(real,esk1_0),esk2_0)))))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ p(s(bool,i(s(fun(cart(real,X1),bool),X2),s(cart(real,X1),X3))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2))))
| p(s(bool,i(s(fun(cart(real,X1),bool),X2),s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),vectoru_neg),s(cart(real,X1),X3)))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]) ).
cnf(c_0_15,plain,
p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),span),s(fun(cart(real,X1),bool),X2)))))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),esk3_0))),s(cart(real,esk1_0),esk2_0)))),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO465+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 16:29:03 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 141.58/22.16 % Version: 3.5.1
% 141.58/22.16 % Preprocessing class: FMLMSMSLSSSNFFN.
% 141.58/22.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.58/22.16 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 141.58/22.16 % Starting new_bool_3 with 600s (2) cores
% 141.58/22.16 % Starting new_bool_1 with 600s (2) cores
% 141.58/22.16 % Starting sh5l with 300s (1) cores
% 141.58/22.16 % new_bool_1 with pid 1376847 completed with status 0
% 141.58/22.16 % Result found by new_bool_1
% 141.58/22.16 % Preprocessing class: FMLMSMSLSSSNFFN.
% 141.58/22.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.58/22.16 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 141.58/22.16 % Starting new_bool_3 with 600s (2) cores
% 141.58/22.16 % Starting new_bool_1 with 600s (2) cores
% 141.58/22.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 141.58/22.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 141.58/22.16 % Search class: FGHSM-SMLM33-DFFFFFNN
% 141.58/22.16 % Scheduled 7 strats onto 2 cores with 599 seconds (599 total)
% 141.58/22.16 % Starting SubtermCWHack with 54s (1) cores
% 141.58/22.16 % Starting new_bool_1 with 60s (1) cores
% 141.58/22.16 % SubtermCWHack with pid 1376852 completed with status 0
% 141.58/22.16 % Result found by SubtermCWHack
% 141.58/22.16 % Preprocessing class: FMLMSMSLSSSNFFN.
% 141.58/22.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 141.58/22.16 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 141.58/22.16 % Starting new_bool_3 with 600s (2) cores
% 141.58/22.16 % Starting new_bool_1 with 600s (2) cores
% 141.58/22.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 141.58/22.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 141.58/22.16 % Search class: FGHSM-SMLM33-DFFFFFNN
% 141.58/22.16 % Scheduled 7 strats onto 2 cores with 599 seconds (599 total)
% 141.58/22.16 % Starting SubtermCWHack with 54s (1) cores
% 141.58/22.16 % Preprocessing time : 0.212 s
% 141.58/22.16
% 141.58/22.16 % Proof found!
% 141.58/22.16 % SZS status Theorem
% 141.58/22.16 % SZS output start CNFRefutation
% See solution above
% 141.58/22.16 % Parsed axioms : 3336
% 141.58/22.16 % Removed by relevancy pruning/SinE : 1747
% 141.58/22.16 % Initial clauses : 4687
% 141.58/22.16 % Removed in clause preprocessing : 175
% 141.58/22.16 % Initial clauses in saturation : 4512
% 141.58/22.16 % Processed clauses : 17435
% 141.58/22.16 % ...of these trivial : 135
% 141.58/22.16 % ...subsumed : 14496
% 141.58/22.16 % ...remaining for further processing : 2804
% 141.58/22.16 % Other redundant clauses eliminated : 0
% 141.58/22.16 % Clauses deleted for lack of memory : 0
% 141.58/22.16 % Backward-subsumed : 45
% 141.58/22.16 % Backward-rewritten : 30
% 141.58/22.16 % Generated clauses : 993726
% 141.58/22.16 % ...of the previous two non-redundant : 814000
% 141.58/22.16 % ...aggressively subsumed : 0
% 141.58/22.16 % Contextual simplify-reflections : 8
% 141.58/22.16 % Paramodulations : 993627
% 141.58/22.16 % Factorizations : 17
% 141.58/22.16 % NegExts : 0
% 141.58/22.16 % Equation resolutions : 82
% 141.58/22.16 % Disequality decompositions : 0
% 141.58/22.16 % Total rewrite steps : 305592
% 141.58/22.16 % ...of those cached : 264407
% 141.58/22.16 % Propositional unsat checks : 0
% 141.58/22.16 % Propositional check models : 0
% 141.58/22.16 % Propositional check unsatisfiable : 0
% 141.58/22.16 % Propositional clauses : 0
% 141.58/22.16 % Propositional clauses after purity: 0
% 141.58/22.16 % Propositional unsat core size : 0
% 141.58/22.16 % Propositional preprocessing time : 0.000
% 141.58/22.16 % Propositional encoding time : 0.000
% 141.58/22.16 % Propositional solver time : 0.000
% 141.58/22.16 % Success case prop preproc time : 0.000
% 141.58/22.16 % Success case prop encoding time : 0.000
% 141.58/22.16 % Success case prop solver time : 0.000
% 141.58/22.16 % Current number of processed clauses : 2729
% 141.58/22.16 % Positive orientable unit clauses : 924
% 141.58/22.16 % Positive unorientable unit clauses: 84
% 141.58/22.16 % Negative unit clauses : 222
% 141.58/22.16 % Non-unit-clauses : 1499
% 141.58/22.16 % Current number of unprocessed clauses: 800587
% 141.58/22.16 % ...number of literals in the above : 3017037
% 141.58/22.16 % Current number of archived formulas : 0
% 141.58/22.16 % Current number of archived clauses : 75
% 141.58/22.16 % Clause-clause subsumption calls (NU) : 443897
% 141.58/22.16 % Rec. Clause-clause subsumption calls : 185346
% 141.58/22.16 % Non-unit clause-clause subsumptions : 5654
% 141.58/22.16 % Unit Clause-clause subsumption calls : 60217
% 141.58/22.16 % Rewrite failures with RHS unbound : 1684
% 141.58/22.16 % BW rewrite match attempts : 146868
% 141.58/22.16 % BW rewrite match successes : 120
% 141.58/22.16 % Condensation attempts : 0
% 141.58/22.16 % Condensation successes : 0
% 141.58/22.16 % Termbank termtop insertions : 80051325
% 141.58/22.16 % Search garbage collected termcells : 128039
% 141.58/22.16
% 141.58/22.16 % -------------------------------------------------
% 141.58/22.16 % User time : 20.347 s
% 141.58/22.16 % System time : 0.535 s
% 141.58/22.16 % Total time : 20.882 s
% 141.58/22.16 % Maximum resident set size: 36668 pages
% 141.58/22.16
% 141.58/22.16 % -------------------------------------------------
% 141.58/22.16 % User time : 40.284 s
% 141.58/22.16 % System time : 0.954 s
% 141.58/22.16 % Total time : 41.238 s
% 141.58/22.16 % Maximum resident set size: 14848 pages
% 141.58/22.16 % E exiting
%------------------------------------------------------------------------------