TSTP Solution File: GEO464+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO464+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 190.14s 26.95s
% Output : CNFRefutation 190.14s
% 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 : 8 ( 3 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 39 ( 3 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSPANu_CLAUSESu_conjunct3,conjecture,
! [X1387,X1,X95,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1387),bool),bool),i(s(fun(cart(real,X1387),fun(fun(cart(real,X1387),bool),bool)),in),s(cart(real,X1387),X1))),s(fun(cart(real,X1387),bool),i(s(fun(fun(cart(real,X1387),bool),fun(cart(real,X1387),bool)),span),s(fun(cart(real,X1387),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1387),bool),bool),i(s(fun(cart(real,X1387),fun(fun(cart(real,X1387),bool),bool)),in),s(cart(real,X1387),i(s(fun(cart(real,X1387),cart(real,X1387)),i(s(fun(real,fun(cart(real,X1387),cart(real,X1387))),r_),s(real,X95))),s(cart(real,X1387),X1))))),s(fun(cart(real,X1387),bool),i(s(fun(fun(cart(real,X1387),bool),fun(cart(real,X1387),bool)),span),s(fun(cart(real,X1387),bool),X97)))))) ),
file('/export/starexec/sandbox2/tmp/tmp.Wbuz1jwQZQ/E---3.1_27772.p',aSPANu_CLAUSESu_conjunct3) ).
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/sandbox2/tmp/tmp.Wbuz1jwQZQ/E---3.1_27772.p',aIN) ).
fof(aSUBSPACEu_MUL,axiom,
! [X1368,X1,X95,X97] :
( ( p(s(bool,i(s(fun(fun(cart(real,X1368),bool),bool),subspace),s(fun(cart(real,X1368),bool),X97))))
& p(s(bool,i(s(fun(fun(cart(real,X1368),bool),bool),i(s(fun(cart(real,X1368),fun(fun(cart(real,X1368),bool),bool)),in),s(cart(real,X1368),X1))),s(fun(cart(real,X1368),bool),X97)))) )
=> p(s(bool,i(s(fun(fun(cart(real,X1368),bool),bool),i(s(fun(cart(real,X1368),fun(fun(cart(real,X1368),bool),bool)),in),s(cart(real,X1368),i(s(fun(cart(real,X1368),cart(real,X1368)),i(s(fun(real,fun(cart(real,X1368),cart(real,X1368))),r_),s(real,X95))),s(cart(real,X1368),X1))))),s(fun(cart(real,X1368),bool),X97)))) ),
file('/export/starexec/sandbox2/tmp/tmp.Wbuz1jwQZQ/E---3.1_27772.p',aSUBSPACEu_MUL) ).
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/sandbox2/tmp/tmp.Wbuz1jwQZQ/E---3.1_27772.p',aSUBSPACEu_SPAN) ).
fof(c_0_4,negated_conjecture,
~ ! [X1387,X1,X95,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1387),bool),bool),i(s(fun(cart(real,X1387),fun(fun(cart(real,X1387),bool),bool)),in),s(cart(real,X1387),X1))),s(fun(cart(real,X1387),bool),i(s(fun(fun(cart(real,X1387),bool),fun(cart(real,X1387),bool)),span),s(fun(cart(real,X1387),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1387),bool),bool),i(s(fun(cart(real,X1387),fun(fun(cart(real,X1387),bool),bool)),in),s(cart(real,X1387),i(s(fun(cart(real,X1387),cart(real,X1387)),i(s(fun(real,fun(cart(real,X1387),cart(real,X1387))),r_),s(real,X95))),s(cart(real,X1387),X1))))),s(fun(cart(real,X1387),bool),i(s(fun(fun(cart(real,X1387),bool),fun(cart(real,X1387),bool)),span),s(fun(cart(real,X1387),bool),X97)))))) ),
inference(assume_negation,[status(cth)],[aSPANu_CLAUSESu_conjunct3]) ).
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),esk4_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)),i(s(fun(real,fun(cart(real,esk1_0),cart(real,esk1_0))),r_),s(real,esk3_0))),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),esk4_0)))))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X2270,X2271,X2272] : s(bool,i(s(fun(fun(X2270,bool),bool),i(s(fun(X2270,fun(fun(X2270,bool),bool)),in),s(X2270,X2272))),s(fun(X2270,bool),X2271))) = s(bool,i(s(fun(X2270,bool),X2271),s(X2270,X2272))),
inference(variable_rename,[status(thm)],[aIN]) ).
fof(c_0_7,plain,
! [X2340,X2341,X2342,X2343] :
( ~ p(s(bool,i(s(fun(fun(cart(real,X2340),bool),bool),subspace),s(fun(cart(real,X2340),bool),X2343))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2340),bool),bool),i(s(fun(cart(real,X2340),fun(fun(cart(real,X2340),bool),bool)),in),s(cart(real,X2340),X2341))),s(fun(cart(real,X2340),bool),X2343))))
| p(s(bool,i(s(fun(fun(cart(real,X2340),bool),bool),i(s(fun(cart(real,X2340),fun(fun(cart(real,X2340),bool),bool)),in),s(cart(real,X2340),i(s(fun(cart(real,X2340),cart(real,X2340)),i(s(fun(real,fun(cart(real,X2340),cart(real,X2340))),r_),s(real,X2342))),s(cart(real,X2340),X2341))))),s(fun(cart(real,X2340),bool),X2343)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aSUBSPACEu_MUL])]) ).
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)),i(s(fun(real,fun(cart(real,esk1_0),cart(real,esk1_0))),r_),s(real,esk3_0))),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),esk4_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)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,X4))),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,
! [X2082,X2083] : p(s(bool,i(s(fun(fun(cart(real,X2082),bool),bool),subspace),s(fun(cart(real,X2082),bool),i(s(fun(fun(cart(real,X2082),bool),fun(cart(real,X2082),bool)),span),s(fun(cart(real,X2082),bool),X2083)))))),
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),esk4_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),esk4_0))),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),i(s(fun(real,fun(cart(real,esk1_0),cart(real,esk1_0))),r_),s(real,esk3_0))),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)),i(s(fun(real,fun(cart(real,X1),cart(real,X1))),r_),s(real,X3))),s(cart(real,X1),X4))))))
| ~ 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),X4)))) ),
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),esk4_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.07/1.14 % Problem : GEO464+1 : TPTP v8.1.2. Released v7.0.0.
% 1.14/1.15 % Command : run_E %s %d THM
% 1.15/1.36 % Computer : n010.cluster.edu
% 1.15/1.36 % Model : x86_64 x86_64
% 1.15/1.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.15/1.36 % Memory : 8042.1875MB
% 1.15/1.36 % OS : Linux 3.10.0-693.el7.x86_64
% 1.15/1.36 % CPULimit : 2400
% 1.21/1.36 % WCLimit : 300
% 1.21/1.36 % DateTime : Tue Oct 3 06:33:51 EDT 2023
% 1.21/1.36 % CPUTime :
% 2.28/2.44 Running first-order theorem proving
% 2.28/2.44 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/tmp/tmp.Wbuz1jwQZQ/E---3.1_27772.p
% 190.14/26.95 # Version: 3.1pre001
% 190.14/26.95 # Preprocessing class: FMLMSMSLSSSNFFN.
% 190.14/26.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 190.14/26.95 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 190.14/26.95 # Starting new_bool_3 with 600s (2) cores
% 190.14/26.95 # Starting new_bool_1 with 600s (2) cores
% 190.14/26.95 # Starting sh5l with 300s (1) cores
% 190.14/26.95 # new_bool_1 with pid 27852 completed with status 0
% 190.14/26.95 # Result found by new_bool_1
% 190.14/26.95 # Preprocessing class: FMLMSMSLSSSNFFN.
% 190.14/26.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 190.14/26.95 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 190.14/26.95 # Starting new_bool_3 with 600s (2) cores
% 190.14/26.95 # Starting new_bool_1 with 600s (2) cores
% 190.14/26.95 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 190.14/26.95 # Search class: FGHSM-SMLM33-DFFFFFNN
% 190.14/26.95 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 190.14/26.95 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 190.14/26.95 # Starting new_bool_1 with 61s (1) cores
% 190.14/26.95 # SAT001_MinMin_p005000_rr with pid 27856 completed with status 0
% 190.14/26.95 # Result found by SAT001_MinMin_p005000_rr
% 190.14/26.95 # Preprocessing class: FMLMSMSLSSSNFFN.
% 190.14/26.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 190.14/26.95 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 190.14/26.95 # Starting new_bool_3 with 600s (2) cores
% 190.14/26.95 # Starting new_bool_1 with 600s (2) cores
% 190.14/26.95 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 190.14/26.95 # Search class: FGHSM-SMLM33-DFFFFFNN
% 190.14/26.95 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 190.14/26.95 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 190.14/26.95 # Preprocessing time : 0.365 s
% 190.14/26.95 # Presaturation interreduction done
% 190.14/26.95
% 190.14/26.95 # Proof found!
% 190.14/26.95 # SZS status Theorem
% 190.14/26.95 # SZS output start CNFRefutation
% See solution above
% 190.14/26.95 # Parsed axioms : 3319
% 190.14/26.95 # Removed by relevancy pruning/SinE : 1830
% 190.14/26.95 # Initial clauses : 4493
% 190.14/26.95 # Removed in clause preprocessing : 172
% 190.14/26.95 # Initial clauses in saturation : 4321
% 190.14/26.95 # Processed clauses : 17419
% 190.14/26.95 # ...of these trivial : 113
% 190.14/26.95 # ...subsumed : 11649
% 190.14/26.95 # ...remaining for further processing : 5657
% 190.14/26.95 # Other redundant clauses eliminated : 0
% 190.14/26.95 # Clauses deleted for lack of memory : 0
% 190.14/26.95 # Backward-subsumed : 43
% 190.14/26.95 # Backward-rewritten : 64
% 190.14/26.95 # Generated clauses : 613072
% 190.14/26.95 # ...of the previous two non-redundant : 488695
% 190.14/26.95 # ...aggressively subsumed : 0
% 190.14/26.95 # Contextual simplify-reflections : 268
% 190.14/26.95 # Paramodulations : 612998
% 190.14/26.95 # Factorizations : 14
% 190.14/26.95 # NegExts : 0
% 190.14/26.95 # Equation resolutions : 60
% 190.14/26.95 # Total rewrite steps : 234608
% 190.14/26.95 # Propositional unsat checks : 1
% 190.14/26.95 # Propositional check models : 0
% 190.14/26.95 # Propositional check unsatisfiable : 0
% 190.14/26.95 # Propositional clauses : 0
% 190.14/26.95 # Propositional clauses after purity: 0
% 190.14/26.95 # Propositional unsat core size : 0
% 190.14/26.95 # Propositional preprocessing time : 0.000
% 190.14/26.95 # Propositional encoding time : 1.443
% 190.14/26.95 # Propositional solver time : 0.223
% 190.14/26.95 # Success case prop preproc time : 0.000
% 190.14/26.95 # Success case prop encoding time : 0.000
% 190.14/26.95 # Success case prop solver time : 0.000
% 190.14/26.95 # Current number of processed clauses : 1908
% 190.14/26.95 # Positive orientable unit clauses : 538
% 190.14/26.95 # Positive unorientable unit clauses: 42
% 190.14/26.95 # Negative unit clauses : 192
% 190.14/26.95 # Non-unit-clauses : 1136
% 190.14/26.95 # Current number of unprocessed clauses: 478252
% 190.14/26.95 # ...number of literals in the above : 1349380
% 190.14/26.95 # Current number of archived formulas : 0
% 190.14/26.95 # Current number of archived clauses : 3749
% 190.14/26.95 # Clause-clause subsumption calls (NU) : 6097764
% 190.14/26.95 # Rec. Clause-clause subsumption calls : 460789
% 190.14/26.95 # Non-unit clause-clause subsumptions : 4205
% 190.14/26.95 # Unit Clause-clause subsumption calls : 11038
% 190.14/26.95 # Rewrite failures with RHS unbound : 804
% 190.14/26.95 # BW rewrite match attempts : 184443
% 190.14/26.95 # BW rewrite match successes : 509
% 190.14/26.95 # Condensation attempts : 0
% 190.14/26.95 # Condensation successes : 0
% 190.14/26.95 # Termbank termtop insertions : 64585662
% 190.14/26.95
% 190.14/26.95 # -------------------------------------------------
% 190.14/26.95 # User time : 23.395 s
% 190.14/26.95 # System time : 0.496 s
% 190.14/26.95 # Total time : 23.891 s
% 190.14/26.95 # Maximum resident set size: 33248 pages
% 190.14/26.95
% 190.14/26.95 # -------------------------------------------------
% 190.14/26.95 # User time : 47.065 s
% 190.14/26.95 # System time : 0.511 s
% 190.14/26.95 # Total time : 47.577 s
% 190.14/26.95 # Maximum resident set size: 11928 pages
% 190.14/26.95 % E---3.1 exiting
% 190.14/26.95 % E---3.1 exiting
%------------------------------------------------------------------------------