TSTP Solution File: GEO465+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO465+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:32:49 EDT 2023
% Result : Theorem 260.87s 37.35s
% Output : CNFRefutation 260.87s
% 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/tmp/tmp.4FYccBwp52/E---3.1_27922.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/tmp/tmp.4FYccBwp52/E---3.1_27922.p',aIN) ).
fof(aSUBSPACEu_NEG,axiom,
! [X1369,X1,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),X1))),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/tmp/tmp.4FYccBwp52/E---3.1_27922.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/tmp/tmp.4FYccBwp52/E---3.1_27922.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),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),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(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),subspace),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),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)))) ),
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),i(s(fun(cart(real,X1),cart(real,X1)),vectoru_neg),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),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),i(s(fun(cart(real,X1),cart(real,X1)),vectoru_neg),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),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
% 1.52/1.59 % Problem : GEO465+1 : TPTP v8.1.2. Released v7.0.0.
% 1.52/1.60 % Command : run_E %s %d THM
% 1.61/1.80 % Computer : n028.cluster.edu
% 1.61/1.80 % Model : x86_64 x86_64
% 1.61/1.80 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.61/1.80 % Memory : 8042.1875MB
% 1.61/1.80 % OS : Linux 3.10.0-693.el7.x86_64
% 1.61/1.80 % CPULimit : 2400
% 1.61/1.80 % WCLimit : 300
% 1.61/1.80 % DateTime : Tue Oct 3 06:27:09 EDT 2023
% 1.61/1.80 % CPUTime :
% 3.34/3.57 Running first-order theorem proving
% 3.34/3.57 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/tmp/tmp.4FYccBwp52/E---3.1_27922.p
% 260.87/37.35 # Version: 3.1pre001
% 260.87/37.35 # Preprocessing class: FMLMSMSLSSSNFFN.
% 260.87/37.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.87/37.35 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 260.87/37.35 # Starting new_bool_3 with 600s (2) cores
% 260.87/37.35 # Starting new_bool_1 with 600s (2) cores
% 260.87/37.35 # Starting sh5l with 300s (1) cores
% 260.87/37.35 # new_bool_1 with pid 28002 completed with status 0
% 260.87/37.35 # Result found by new_bool_1
% 260.87/37.35 # Preprocessing class: FMLMSMSLSSSNFFN.
% 260.87/37.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.87/37.35 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 260.87/37.35 # Starting new_bool_3 with 600s (2) cores
% 260.87/37.35 # Starting new_bool_1 with 600s (2) cores
% 260.87/37.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 260.87/37.35 # Search class: FGHSM-SMLM33-DFFFFFNN
% 260.87/37.35 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 260.87/37.35 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 260.87/37.35 # Starting new_bool_1 with 61s (1) cores
% 260.87/37.35 # SAT001_MinMin_p005000_rr with pid 28006 completed with status 0
% 260.87/37.35 # Result found by SAT001_MinMin_p005000_rr
% 260.87/37.35 # Preprocessing class: FMLMSMSLSSSNFFN.
% 260.87/37.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 260.87/37.35 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 260.87/37.35 # Starting new_bool_3 with 600s (2) cores
% 260.87/37.35 # Starting new_bool_1 with 600s (2) cores
% 260.87/37.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 260.87/37.35 # Search class: FGHSM-SMLM33-DFFFFFNN
% 260.87/37.35 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 260.87/37.35 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 260.87/37.35 # Preprocessing time : 0.475 s
% 260.87/37.35 # Presaturation interreduction done
% 260.87/37.35
% 260.87/37.35 # Proof found!
% 260.87/37.35 # SZS status Theorem
% 260.87/37.35 # SZS output start CNFRefutation
% See solution above
% 260.87/37.35 # Parsed axioms : 3336
% 260.87/37.35 # Removed by relevancy pruning/SinE : 1747
% 260.87/37.35 # Initial clauses : 4687
% 260.87/37.35 # Removed in clause preprocessing : 175
% 260.87/37.35 # Initial clauses in saturation : 4512
% 260.87/37.35 # Processed clauses : 16484
% 260.87/37.35 # ...of these trivial : 120
% 260.87/37.35 # ...subsumed : 10737
% 260.87/37.35 # ...remaining for further processing : 5627
% 260.87/37.35 # Other redundant clauses eliminated : 0
% 260.87/37.35 # Clauses deleted for lack of memory : 0
% 260.87/37.35 # Backward-subsumed : 40
% 260.87/37.35 # Backward-rewritten : 68
% 260.87/37.35 # Generated clauses : 540560
% 260.87/37.35 # ...of the previous two non-redundant : 413133
% 260.87/37.35 # ...aggressively subsumed : 0
% 260.87/37.35 # Contextual simplify-reflections : 268
% 260.87/37.35 # Paramodulations : 540492
% 260.87/37.35 # Factorizations : 15
% 260.87/37.35 # NegExts : 0
% 260.87/37.35 # Equation resolutions : 53
% 260.87/37.35 # Total rewrite steps : 227993
% 260.87/37.35 # Propositional unsat checks : 1
% 260.87/37.35 # Propositional check models : 0
% 260.87/37.35 # Propositional check unsatisfiable : 0
% 260.87/37.35 # Propositional clauses : 0
% 260.87/37.35 # Propositional clauses after purity: 0
% 260.87/37.35 # Propositional unsat core size : 0
% 260.87/37.35 # Propositional preprocessing time : 0.000
% 260.87/37.35 # Propositional encoding time : 1.570
% 260.87/37.35 # Propositional solver time : 0.247
% 260.87/37.35 # Success case prop preproc time : 0.000
% 260.87/37.35 # Success case prop encoding time : 0.000
% 260.87/37.35 # Success case prop solver time : 0.000
% 260.87/37.35 # Current number of processed clauses : 1698
% 260.87/37.35 # Positive orientable unit clauses : 513
% 260.87/37.35 # Positive unorientable unit clauses: 48
% 260.87/37.35 # Negative unit clauses : 162
% 260.87/37.35 # Non-unit-clauses : 975
% 260.87/37.35 # Current number of unprocessed clauses: 404203
% 260.87/37.35 # ...number of literals in the above : 1065133
% 260.87/37.35 # Current number of archived formulas : 0
% 260.87/37.35 # Current number of archived clauses : 3929
% 260.87/37.35 # Clause-clause subsumption calls (NU) : 6403936
% 260.87/37.35 # Rec. Clause-clause subsumption calls : 430882
% 260.87/37.35 # Non-unit clause-clause subsumptions : 3820
% 260.87/37.35 # Unit Clause-clause subsumption calls : 3890
% 260.87/37.35 # Rewrite failures with RHS unbound : 850
% 260.87/37.35 # BW rewrite match attempts : 234590
% 260.87/37.35 # BW rewrite match successes : 535
% 260.87/37.35 # Condensation attempts : 0
% 260.87/37.35 # Condensation successes : 0
% 260.87/37.35 # Termbank termtop insertions : 58493646
% 260.87/37.35
% 260.87/37.35 # -------------------------------------------------
% 260.87/37.35 # User time : 32.480 s
% 260.87/37.35 # System time : 0.595 s
% 260.87/37.35 # Total time : 33.076 s
% 260.87/37.35 # Maximum resident set size: 34776 pages
% 260.87/37.35
% 260.87/37.35 # -------------------------------------------------
% 260.87/37.35 # User time : 65.124 s
% 260.87/37.35 # System time : 0.624 s
% 260.87/37.35 # Total time : 65.748 s
% 260.87/37.35 # Maximum resident set size: 11976 pages
% 260.87/37.35 % E---3.1 exiting
% 260.87/37.35 % E---3.1 exiting
%------------------------------------------------------------------------------