TSTP Solution File: GEO452+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO452+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:47 EDT 2023
% Result : Theorem 274.54s 37.15s
% Output : CNFRefutation 274.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 11 ( 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 : 20 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aMATRIXu_VECTORu_MUL,conjecture,
! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.zuuGNxhIIg/E---3.1_26876.p',aMATRIXu_VECTORu_MUL) ).
fof(aMATRIXu_WORKS,axiom,
! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.zuuGNxhIIg/E---3.1_26876.p',aMATRIXu_WORKS) ).
fof(c_0_2,negated_conjecture,
~ ! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
inference(assume_negation,[status(cth)],[aMATRIXu_VECTORu_MUL]) ).
fof(c_0_3,negated_conjecture,
( p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))
& s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X1396,X1397,X1398,X1399] :
( ~ p(s(bool,i(s(fun(fun(cart(real,X1397),cart(real,X1396)),bool),linear),s(fun(cart(real,X1397),cart(real,X1396)),X1398))))
| s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),i(s(fun(cart(cart(real,X1397),X1396),fun(cart(real,X1397),cart(real,X1396))),matrixu_vectoru_mul),s(cart(cart(real,X1397),X1396),i(s(fun(fun(cart(real,X1397),cart(real,X1396)),cart(cart(real,X1397),X1396)),matrix),s(fun(cart(real,X1397),cart(real,X1396)),X1398))))),s(cart(real,X1397),X1399))) = s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),X1398),s(cart(real,X1397),X1399))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aMATRIXu_WORKS])])]) ).
cnf(c_0_5,negated_conjecture,
s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( s(cart(real,X2),i(s(fun(cart(real,X1),cart(real,X2)),i(s(fun(cart(cart(real,X1),X2),fun(cart(real,X1),cart(real,X2))),matrixu_vectoru_mul),s(cart(cart(real,X1),X2),i(s(fun(fun(cart(real,X1),cart(real,X2)),cart(cart(real,X1),X2)),matrix),s(fun(cart(real,X1),cart(real,X2)),X3))))),s(cart(real,X1),X4))) = s(cart(real,X2),i(s(fun(cart(real,X1),cart(real,X2)),X3),s(cart(real,X1),X4)))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),cart(real,X2)),bool),linear),s(fun(cart(real,X1),cart(real,X2)),X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0)))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.91/0.96 % Problem : GEO452+1 : TPTP v8.1.2. Released v7.0.0.
% 0.96/0.96 % Command : run_E %s %d THM
% 0.99/1.17 % Computer : n008.cluster.edu
% 0.99/1.17 % Model : x86_64 x86_64
% 0.99/1.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.99/1.17 % Memory : 8042.1875MB
% 0.99/1.17 % OS : Linux 3.10.0-693.el7.x86_64
% 0.99/1.17 % CPULimit : 2400
% 0.99/1.17 % WCLimit : 300
% 0.99/1.17 % DateTime : Tue Oct 3 06:12:44 EDT 2023
% 0.99/1.17 % CPUTime :
% 1.94/2.13 Running first-order theorem proving
% 1.94/2.13 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.zuuGNxhIIg/E---3.1_26876.p
% 274.54/37.15 # Version: 3.1pre001
% 274.54/37.15 # Preprocessing class: FMLMSMSLSSSNFFN.
% 274.54/37.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 274.54/37.15 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 274.54/37.15 # Starting new_bool_3 with 600s (2) cores
% 274.54/37.15 # Starting new_bool_1 with 600s (2) cores
% 274.54/37.15 # Starting sh5l with 300s (1) cores
% 274.54/37.15 # new_bool_1 with pid 26956 completed with status 0
% 274.54/37.15 # Result found by new_bool_1
% 274.54/37.15 # Preprocessing class: FMLMSMSLSSSNFFN.
% 274.54/37.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 274.54/37.15 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 274.54/37.15 # Starting new_bool_3 with 600s (2) cores
% 274.54/37.15 # Starting new_bool_1 with 600s (2) cores
% 274.54/37.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 274.54/37.15 # Search class: FGHSM-SMLM33-DFFFFFNN
% 274.54/37.15 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 274.54/37.15 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 274.54/37.15 # Starting new_bool_1 with 61s (1) cores
% 274.54/37.15 # SAT001_MinMin_p005000_rr with pid 26958 completed with status 0
% 274.54/37.15 # Result found by SAT001_MinMin_p005000_rr
% 274.54/37.15 # Preprocessing class: FMLMSMSLSSSNFFN.
% 274.54/37.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 274.54/37.15 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 274.54/37.15 # Starting new_bool_3 with 600s (2) cores
% 274.54/37.15 # Starting new_bool_1 with 600s (2) cores
% 274.54/37.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 274.54/37.15 # Search class: FGHSM-SMLM33-DFFFFFNN
% 274.54/37.15 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 274.54/37.15 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 274.54/37.15 # Preprocessing time : 0.351 s
% 274.54/37.15 # Presaturation interreduction done
% 274.54/37.15
% 274.54/37.15 # Proof found!
% 274.54/37.15 # SZS status Theorem
% 274.54/37.15 # SZS output start CNFRefutation
% See solution above
% 274.54/37.15 # Parsed axioms : 3177
% 274.54/37.15 # Removed by relevancy pruning/SinE : 1754
% 274.54/37.15 # Initial clauses : 3789
% 274.54/37.15 # Removed in clause preprocessing : 183
% 274.54/37.15 # Initial clauses in saturation : 3606
% 274.54/37.15 # Processed clauses : 17859
% 274.54/37.15 # ...of these trivial : 107
% 274.54/37.15 # ...subsumed : 12530
% 274.54/37.15 # ...remaining for further processing : 5222
% 274.54/37.15 # Other redundant clauses eliminated : 0
% 274.54/37.15 # Clauses deleted for lack of memory : 0
% 274.54/37.15 # Backward-subsumed : 35
% 274.54/37.15 # Backward-rewritten : 56
% 274.54/37.15 # Generated clauses : 812800
% 274.54/37.15 # ...of the previous two non-redundant : 672944
% 274.54/37.15 # ...aggressively subsumed : 0
% 274.54/37.15 # Contextual simplify-reflections : 209
% 274.54/37.15 # Paramodulations : 812673
% 274.54/37.15 # Factorizations : 13
% 274.54/37.15 # NegExts : 0
% 274.54/37.15 # Equation resolutions : 114
% 274.54/37.15 # Total rewrite steps : 275946
% 274.54/37.15 # Propositional unsat checks : 1
% 274.54/37.15 # Propositional check models : 0
% 274.54/37.15 # Propositional check unsatisfiable : 0
% 274.54/37.15 # Propositional clauses : 0
% 274.54/37.15 # Propositional clauses after purity: 0
% 274.54/37.15 # Propositional unsat core size : 0
% 274.54/37.15 # Propositional preprocessing time : 0.000
% 274.54/37.15 # Propositional encoding time : 3.943
% 274.54/37.15 # Propositional solver time : 0.540
% 274.54/37.15 # Success case prop preproc time : 0.000
% 274.54/37.15 # Success case prop encoding time : 0.000
% 274.54/37.15 # Success case prop solver time : 0.000
% 274.54/37.15 # Current number of processed clauses : 2120
% 274.54/37.15 # Positive orientable unit clauses : 530
% 274.54/37.15 # Positive unorientable unit clauses: 59
% 274.54/37.15 # Negative unit clauses : 152
% 274.54/37.15 # Non-unit-clauses : 1379
% 274.54/37.15 # Current number of unprocessed clauses: 659785
% 274.54/37.15 # ...number of literals in the above : 1922643
% 274.54/37.15 # Current number of archived formulas : 0
% 274.54/37.15 # Current number of archived clauses : 3102
% 274.54/37.15 # Clause-clause subsumption calls (NU) : 5245270
% 274.54/37.15 # Rec. Clause-clause subsumption calls : 479297
% 274.54/37.15 # Non-unit clause-clause subsumptions : 6339
% 274.54/37.15 # Unit Clause-clause subsumption calls : 9241
% 274.54/37.15 # Rewrite failures with RHS unbound : 14
% 274.54/37.15 # BW rewrite match attempts : 171548
% 274.54/37.15 # BW rewrite match successes : 436
% 274.54/37.15 # Condensation attempts : 0
% 274.54/37.15 # Condensation successes : 0
% 274.54/37.15 # Termbank termtop insertions : 102201539
% 274.54/37.15
% 274.54/37.15 # -------------------------------------------------
% 274.54/37.15 # User time : 33.751 s
% 274.54/37.15 # System time : 0.826 s
% 274.54/37.15 # Total time : 34.576 s
% 274.54/37.15 # Maximum resident set size: 30736 pages
% 274.54/37.15
% 274.54/37.15 # -------------------------------------------------
% 274.54/37.15 # User time : 67.875 s
% 274.54/37.15 # System time : 0.844 s
% 274.54/37.15 # Total time : 68.719 s
% 274.54/37.15 # Maximum resident set size: 11424 pages
% 274.54/37.15 % E---3.1 exiting
% 274.54/37.15 % E---3.1 exiting
%------------------------------------------------------------------------------