TSTP Solution File: GEO465+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO465+1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:02:12 EDT 2024
% Result : Theorem 230.75s 30.42s
% Output : CNFRefutation 230.75s
% 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/sandbox2/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/sandbox2/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),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/sandbox2/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/sandbox2/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),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(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),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(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),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
% 0.10/0.12 % Problem : GEO465+1 : TPTP v8.2.0. Released v7.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 13:37:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 230.75/30.42 # Version: 3.1.0
% 230.75/30.42 # Preprocessing class: FMLMSMSLSSSNFFN.
% 230.75/30.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 230.75/30.42 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 230.75/30.42 # Starting new_bool_3 with 600s (2) cores
% 230.75/30.42 # Starting new_bool_1 with 600s (2) cores
% 230.75/30.42 # Starting sh5l with 300s (1) cores
% 230.75/30.42 # new_bool_3 with pid 23878 completed with status 0
% 230.75/30.42 # Result found by new_bool_3
% 230.75/30.42 # Preprocessing class: FMLMSMSLSSSNFFN.
% 230.75/30.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 230.75/30.42 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 230.75/30.42 # Starting new_bool_3 with 600s (2) cores
% 230.75/30.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 230.75/30.42 # Search class: FGHSM-SMLM33-DFFFFFNN
% 230.75/30.42 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 230.75/30.42 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 230.75/30.42 # Starting new_bool_3 with 61s (1) cores
% 230.75/30.42 # SAT001_MinMin_p005000_rr with pid 24055 completed with status 0
% 230.75/30.42 # Result found by SAT001_MinMin_p005000_rr
% 230.75/30.42 # Preprocessing class: FMLMSMSLSSSNFFN.
% 230.75/30.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 230.75/30.42 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 230.75/30.42 # Starting new_bool_3 with 600s (2) cores
% 230.75/30.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 230.75/30.42 # Search class: FGHSM-SMLM33-DFFFFFNN
% 230.75/30.42 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 230.75/30.42 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 230.75/30.42 # Preprocessing time : 0.312 s
% 230.75/30.42 # Presaturation interreduction done
% 230.75/30.42
% 230.75/30.42 # Proof found!
% 230.75/30.42 # SZS status Theorem
% 230.75/30.42 # SZS output start CNFRefutation
% See solution above
% 230.75/30.42 # Parsed axioms : 3336
% 230.75/30.42 # Removed by relevancy pruning/SinE : 1747
% 230.75/30.42 # Initial clauses : 4687
% 230.75/30.42 # Removed in clause preprocessing : 175
% 230.75/30.42 # Initial clauses in saturation : 4512
% 230.75/30.42 # Processed clauses : 16484
% 230.75/30.42 # ...of these trivial : 120
% 230.75/30.42 # ...subsumed : 10737
% 230.75/30.42 # ...remaining for further processing : 5627
% 230.75/30.42 # Other redundant clauses eliminated : 0
% 230.75/30.42 # Clauses deleted for lack of memory : 0
% 230.75/30.42 # Backward-subsumed : 40
% 230.75/30.42 # Backward-rewritten : 68
% 230.75/30.42 # Generated clauses : 540560
% 230.75/30.42 # ...of the previous two non-redundant : 413199
% 230.75/30.42 # ...aggressively subsumed : 0
% 230.75/30.42 # Contextual simplify-reflections : 268
% 230.75/30.42 # Paramodulations : 540492
% 230.75/30.42 # Factorizations : 15
% 230.75/30.42 # NegExts : 0
% 230.75/30.42 # Equation resolutions : 53
% 230.75/30.42 # Disequality decompositions : 0
% 230.75/30.42 # Total rewrite steps : 228023
% 230.75/30.42 # ...of those cached : 162098
% 230.75/30.42 # Propositional unsat checks : 1
% 230.75/30.42 # Propositional check models : 0
% 230.75/30.42 # Propositional check unsatisfiable : 0
% 230.75/30.42 # Propositional clauses : 0
% 230.75/30.42 # Propositional clauses after purity: 0
% 230.75/30.42 # Propositional unsat core size : 0
% 230.75/30.42 # Propositional preprocessing time : 0.000
% 230.75/30.42 # Propositional encoding time : 1.308
% 230.75/30.42 # Propositional solver time : 0.259
% 230.75/30.42 # Success case prop preproc time : 0.000
% 230.75/30.42 # Success case prop encoding time : 0.000
% 230.75/30.42 # Success case prop solver time : 0.000
% 230.75/30.42 # Current number of processed clauses : 1698
% 230.75/30.42 # Positive orientable unit clauses : 513
% 230.75/30.42 # Positive unorientable unit clauses: 48
% 230.75/30.42 # Negative unit clauses : 162
% 230.75/30.42 # Non-unit-clauses : 975
% 230.75/30.42 # Current number of unprocessed clauses: 404194
% 230.75/30.42 # ...number of literals in the above : 1065124
% 230.75/30.42 # Current number of archived formulas : 0
% 230.75/30.42 # Current number of archived clauses : 3929
% 230.75/30.42 # Clause-clause subsumption calls (NU) : 6403936
% 230.75/30.42 # Rec. Clause-clause subsumption calls : 430882
% 230.75/30.42 # Non-unit clause-clause subsumptions : 3820
% 230.75/30.42 # Unit Clause-clause subsumption calls : 3905
% 230.75/30.42 # Rewrite failures with RHS unbound : 850
% 230.75/30.42 # BW rewrite match attempts : 234590
% 230.75/30.42 # BW rewrite match successes : 535
% 230.75/30.42 # Condensation attempts : 0
% 230.75/30.42 # Condensation successes : 0
% 230.75/30.42 # Termbank termtop insertions : 58522608
% 230.75/30.42 # Search garbage collected termcells : 128039
% 230.75/30.42
% 230.75/30.42 # -------------------------------------------------
% 230.75/30.42 # User time : 28.941 s
% 230.75/30.42 # System time : 0.497 s
% 230.75/30.42 # Total time : 29.438 s
% 230.75/30.42 # Maximum resident set size: 34776 pages
% 230.75/30.42
% 230.75/30.42 # -------------------------------------------------
% 230.75/30.42 # User time : 57.948 s
% 230.75/30.42 # System time : 0.524 s
% 230.75/30.42 # Total time : 58.472 s
% 230.75/30.42 # Maximum resident set size: 11960 pages
% 230.75/30.42 % E---3.1 exiting
%------------------------------------------------------------------------------