TSTP Solution File: GEO447+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO447+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:35:02 EDT 2023
% Result : Theorem 236.01s 31.97s
% Output : CNFRefutation 236.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 28 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 8 ~; 4 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aORTHOGONALu_CLAUSESu_conjunct8,conjecture,
! [X1179,X16,X1,X8] :
( ( p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),X1))),s(cart(real,X1179),X16))))
& p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),X8))),s(cart(real,X1179),X16)))) )
=> p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),i(s(fun(cart(real,X1179),cart(real,X1179)),i(s(fun(cart(real,X1179),fun(cart(real,X1179),cart(real,X1179))),vectoru_add),s(cart(real,X1179),X1))),s(cart(real,X1179),X8))))),s(cart(real,X1179),X16)))) ),
file('/export/starexec/sandbox2/tmp/tmp.nDTeY0N8wV/E---3.1_30367.p',aORTHOGONALu_CLAUSESu_conjunct8) ).
fof(aORTHOGONALu_SYM,axiom,
! [X1168,X1,X8] : s(bool,i(s(fun(cart(real,X1168),bool),i(s(fun(cart(real,X1168),fun(cart(real,X1168),bool)),orthogonal),s(cart(real,X1168),X1))),s(cart(real,X1168),X8))) = s(bool,i(s(fun(cart(real,X1168),bool),i(s(fun(cart(real,X1168),fun(cart(real,X1168),bool)),orthogonal),s(cart(real,X1168),X8))),s(cart(real,X1168),X1))),
file('/export/starexec/sandbox2/tmp/tmp.nDTeY0N8wV/E---3.1_30367.p',aORTHOGONALu_SYM) ).
fof(aORTHOGONALu_CLAUSESu_conjunct3,axiom,
! [X1174,X16,X1,X8] :
( ( p(s(bool,i(s(fun(cart(real,X1174),bool),i(s(fun(cart(real,X1174),fun(cart(real,X1174),bool)),orthogonal),s(cart(real,X1174),X16))),s(cart(real,X1174),X1))))
& p(s(bool,i(s(fun(cart(real,X1174),bool),i(s(fun(cart(real,X1174),fun(cart(real,X1174),bool)),orthogonal),s(cart(real,X1174),X16))),s(cart(real,X1174),X8)))) )
=> p(s(bool,i(s(fun(cart(real,X1174),bool),i(s(fun(cart(real,X1174),fun(cart(real,X1174),bool)),orthogonal),s(cart(real,X1174),X16))),s(cart(real,X1174),i(s(fun(cart(real,X1174),cart(real,X1174)),i(s(fun(cart(real,X1174),fun(cart(real,X1174),cart(real,X1174))),vectoru_add),s(cart(real,X1174),X1))),s(cart(real,X1174),X8)))))) ),
file('/export/starexec/sandbox2/tmp/tmp.nDTeY0N8wV/E---3.1_30367.p',aORTHOGONALu_CLAUSESu_conjunct3) ).
fof(c_0_3,negated_conjecture,
~ ! [X1179,X16,X1,X8] :
( ( p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),X1))),s(cart(real,X1179),X16))))
& p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),X8))),s(cart(real,X1179),X16)))) )
=> p(s(bool,i(s(fun(cart(real,X1179),bool),i(s(fun(cart(real,X1179),fun(cart(real,X1179),bool)),orthogonal),s(cart(real,X1179),i(s(fun(cart(real,X1179),cart(real,X1179)),i(s(fun(cart(real,X1179),fun(cart(real,X1179),cart(real,X1179))),vectoru_add),s(cart(real,X1179),X1))),s(cart(real,X1179),X8))))),s(cart(real,X1179),X16)))) ),
inference(assume_negation,[status(cth)],[aORTHOGONALu_CLAUSESu_conjunct8]) ).
fof(c_0_4,negated_conjecture,
( p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk3_0))),s(cart(real,esk1_0),esk2_0))))
& p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk4_0))),s(cart(real,esk1_0),esk2_0))))
& ~ p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),cart(real,esk1_0))),vectoru_add),s(cart(real,esk1_0),esk3_0))),s(cart(real,esk1_0),esk4_0))))),s(cart(real,esk1_0),esk2_0)))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2021,X2022,X2023] : s(bool,i(s(fun(cart(real,X2021),bool),i(s(fun(cart(real,X2021),fun(cart(real,X2021),bool)),orthogonal),s(cart(real,X2021),X2022))),s(cart(real,X2021),X2023))) = s(bool,i(s(fun(cart(real,X2021),bool),i(s(fun(cart(real,X2021),fun(cart(real,X2021),bool)),orthogonal),s(cart(real,X2021),X2023))),s(cart(real,X2021),X2022))),
inference(variable_rename,[status(thm)],[aORTHOGONALu_SYM]) ).
cnf(c_0_6,negated_conjecture,
~ p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),cart(real,esk1_0))),vectoru_add),s(cart(real,esk1_0),esk3_0))),s(cart(real,esk1_0),esk4_0))))),s(cart(real,esk1_0),esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))) = s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X3))),s(cart(real,X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X2045,X2046,X2047,X2048] :
( ~ p(s(bool,i(s(fun(cart(real,X2045),bool),i(s(fun(cart(real,X2045),fun(cart(real,X2045),bool)),orthogonal),s(cart(real,X2045),X2046))),s(cart(real,X2045),X2047))))
| ~ p(s(bool,i(s(fun(cart(real,X2045),bool),i(s(fun(cart(real,X2045),fun(cart(real,X2045),bool)),orthogonal),s(cart(real,X2045),X2046))),s(cart(real,X2045),X2048))))
| p(s(bool,i(s(fun(cart(real,X2045),bool),i(s(fun(cart(real,X2045),fun(cart(real,X2045),bool)),orthogonal),s(cart(real,X2045),X2046))),s(cart(real,X2045),i(s(fun(cart(real,X2045),cart(real,X2045)),i(s(fun(cart(real,X2045),fun(cart(real,X2045),cart(real,X2045))),vectoru_add),s(cart(real,X2045),X2047))),s(cart(real,X2045),X2048)))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aORTHOGONALu_CLAUSESu_conjunct3])]) ).
cnf(c_0_9,negated_conjecture,
p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk4_0))),s(cart(real,esk1_0),esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk3_0))),s(cart(real,esk1_0),esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk2_0))),s(cart(real,esk1_0),i(s(fun(cart(real,esk1_0),cart(real,esk1_0)),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),cart(real,esk1_0))),vectoru_add),s(cart(real,esk1_0),esk3_0))),s(cart(real,esk1_0),esk4_0)))))),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
( p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),i(s(fun(cart(real,X1),cart(real,X1)),i(s(fun(cart(real,X1),fun(cart(real,X1),cart(real,X1))),vectoru_add),s(cart(real,X1),X3))),s(cart(real,X1),X4))))))
| ~ p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X3))))
| ~ p(s(bool,i(s(fun(cart(real,X1),bool),i(s(fun(cart(real,X1),fun(cart(real,X1),bool)),orthogonal),s(cart(real,X1),X2))),s(cart(real,X1),X4)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk2_0))),s(cart(real,esk1_0),esk4_0)))),
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(cart(real,esk1_0),fun(cart(real,esk1_0),bool)),orthogonal),s(cart(real,esk1_0),esk2_0))),s(cart(real,esk1_0),esk3_0)))),
inference(rw,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : GEO447+1 : TPTP v8.1.2. Released v7.0.0.
% 0.05/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n020.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 2400
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Oct 3 06:35:01 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.97/1.32 Running first-order model finding
% 0.97/1.32 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/tmp/tmp.nDTeY0N8wV/E---3.1_30367.p
% 236.01/31.97 # Version: 3.1pre001
% 236.01/31.97 # Preprocessing class: FMLMSMSLSSSNFFN.
% 236.01/31.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.01/31.97 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 236.01/31.97 # Starting new_bool_3 with 600s (2) cores
% 236.01/31.97 # Starting new_bool_1 with 600s (2) cores
% 236.01/31.97 # Starting sh5l with 300s (1) cores
% 236.01/31.97 # new_bool_1 with pid 30446 completed with status 0
% 236.01/31.97 # Result found by new_bool_1
% 236.01/31.97 # Preprocessing class: FMLMSMSLSSSNFFN.
% 236.01/31.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.01/31.97 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 236.01/31.97 # Starting new_bool_3 with 600s (2) cores
% 236.01/31.97 # Starting new_bool_1 with 600s (2) cores
% 236.01/31.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 236.01/31.97 # Search class: FGHSM-SMLM33-DFFFFFNN
% 236.01/31.97 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 236.01/31.97 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 236.01/31.97 # Starting new_bool_1 with 61s (1) cores
% 236.01/31.97 # SAT001_MinMin_p005000_rr with pid 30450 completed with status 0
% 236.01/31.97 # Result found by SAT001_MinMin_p005000_rr
% 236.01/31.97 # Preprocessing class: FMLMSMSLSSSNFFN.
% 236.01/31.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 236.01/31.97 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 236.01/31.97 # Starting new_bool_3 with 600s (2) cores
% 236.01/31.97 # Starting new_bool_1 with 600s (2) cores
% 236.01/31.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 236.01/31.97 # Search class: FGHSM-SMLM33-DFFFFFNN
% 236.01/31.97 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 236.01/31.97 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 236.01/31.97 # Preprocessing time : 0.406 s
% 236.01/31.97 # Presaturation interreduction done
% 236.01/31.97
% 236.01/31.97 # Proof found!
% 236.01/31.97 # SZS status Theorem
% 236.01/31.97 # SZS output start CNFRefutation
% See solution above
% 236.01/31.97 # Parsed axioms : 3020
% 236.01/31.97 # Removed by relevancy pruning/SinE : 1392
% 236.01/31.97 # Initial clauses : 4996
% 236.01/31.97 # Removed in clause preprocessing : 195
% 236.01/31.97 # Initial clauses in saturation : 4801
% 236.01/31.97 # Processed clauses : 19993
% 236.01/31.97 # ...of these trivial : 138
% 236.01/31.97 # ...subsumed : 13483
% 236.01/31.97 # ...remaining for further processing : 6372
% 236.01/31.97 # Other redundant clauses eliminated : 0
% 236.01/31.97 # Clauses deleted for lack of memory : 0
% 236.01/31.97 # Backward-subsumed : 25
% 236.01/31.97 # Backward-rewritten : 82
% 236.01/31.97 # Generated clauses : 798428
% 236.01/31.97 # ...of the previous two non-redundant : 632674
% 236.01/31.97 # ...aggressively subsumed : 0
% 236.01/31.97 # Contextual simplify-reflections : 287
% 236.01/31.97 # Paramodulations : 798330
% 236.01/31.97 # Factorizations : 14
% 236.01/31.97 # NegExts : 0
% 236.01/31.97 # Equation resolutions : 84
% 236.01/31.97 # Total rewrite steps : 318770
% 236.01/31.97 # Propositional unsat checks : 1
% 236.01/31.97 # Propositional check models : 0
% 236.01/31.97 # Propositional check unsatisfiable : 0
% 236.01/31.97 # Propositional clauses : 0
% 236.01/31.97 # Propositional clauses after purity: 0
% 236.01/31.97 # Propositional unsat core size : 0
% 236.01/31.97 # Propositional preprocessing time : 0.000
% 236.01/31.97 # Propositional encoding time : 0.656
% 236.01/31.97 # Propositional solver time : 0.088
% 236.01/31.97 # Success case prop preproc time : 0.000
% 236.01/31.97 # Success case prop encoding time : 0.000
% 236.01/31.97 # Success case prop solver time : 0.000
% 236.01/31.97 # Current number of processed clauses : 2212
% 236.01/31.97 # Positive orientable unit clauses : 616
% 236.01/31.97 # Positive unorientable unit clauses: 39
% 236.01/31.97 # Negative unit clauses : 189
% 236.01/31.97 # Non-unit-clauses : 1368
% 236.01/31.97 # Current number of unprocessed clauses: 620916
% 236.01/31.97 # ...number of literals in the above : 1779981
% 236.01/31.97 # Current number of archived formulas : 0
% 236.01/31.97 # Current number of archived clauses : 4160
% 236.01/31.97 # Clause-clause subsumption calls (NU) : 7614302
% 236.01/31.97 # Rec. Clause-clause subsumption calls : 505796
% 236.01/31.97 # Non-unit clause-clause subsumptions : 6286
% 236.01/31.97 # Unit Clause-clause subsumption calls : 16052
% 236.01/31.97 # Rewrite failures with RHS unbound : 16
% 236.01/31.97 # BW rewrite match attempts : 252466
% 236.01/31.97 # BW rewrite match successes : 553
% 236.01/31.97 # Condensation attempts : 0
% 236.01/31.97 # Condensation successes : 0
% 236.01/31.97 # Termbank termtop insertions : 75155257
% 236.01/31.97
% 236.01/31.97 # -------------------------------------------------
% 236.01/31.97 # User time : 29.192 s
% 236.01/31.97 # System time : 0.596 s
% 236.01/31.97 # Total time : 29.788 s
% 236.01/31.97 # Maximum resident set size: 35560 pages
% 236.01/31.97
% 236.01/31.97 # -------------------------------------------------
% 236.01/31.97 # User time : 58.684 s
% 236.01/31.97 # System time : 0.617 s
% 236.01/31.97 # Total time : 59.301 s
% 236.01/31.97 # Maximum resident set size: 10836 pages
% 236.01/31.97 % E---3.1 exiting
%------------------------------------------------------------------------------