TSTP Solution File: GEO456+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO456+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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:43:03 EDT 2024
% Result : Theorem 182.83s 23.66s
% Output : CNFRefutation 182.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 23 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aREALu_POLYu_CLAUSESu_conjunct8,axiom,
! [X1] : s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aREALu_POLYu_CLAUSESu_conjunct8) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aNUMERAL) ).
fof(aREALu_MULu_RID,axiom,
! [X1] : s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,X1),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aREALu_MULu_RID) ).
fof(aLIFTu_EQu_CMUL,conjecture,
! [X1] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))) = s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aLIFTu_EQu_CMUL) ).
fof(aLIFTu_CMUL,axiom,
! [X1,X95] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X95))),s(real,X1))))) = s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X95))),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aLIFTu_CMUL) ).
fof(aLIFTu_NUM,axiom,
! [X84] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X84))))) = s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,X84))),
file('/export/starexec/sandbox/tmp/tmp.Sbp5H128VM/E---3.1_10721.p',aLIFTu_NUM) ).
fof(c_0_6,plain,
! [X6652] : s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X6652))),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
inference(variable_rename,[status(thm)],[aREALu_POLYu_CLAUSESu_conjunct8]) ).
fof(c_0_7,plain,
! [X1409] : s(num,i(s(fun(num,num),numeral),s(num,X1409))) = s(num,X1409),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_8,plain,
! [X4918] : s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X4918))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,X4918),
inference(variable_rename,[status(thm)],[aREALu_MULu_RID]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))) = s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),
inference(assume_negation,[status(cth)],[aLIFTu_EQu_CMUL]) ).
fof(c_0_10,plain,
! [X1799,X1800] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1800))),s(real,X1799))))) = s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1800))),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1799))))),
inference(variable_rename,[status(thm)],[aLIFTu_CMUL]) ).
cnf(c_0_11,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,i(s(fun(num,num),numeral),s(num,u_0))))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X1794] : s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1794))))) = s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,X1794))),
inference(variable_rename,[status(thm)],[aLIFTu_NUM]) ).
cnf(c_0_14,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))) = s(real,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))) != s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk1_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_16,plain,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,X2))))) = s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X2))))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
s(real,i(s(fun(num,real),i(s(fun(real,fun(num,real)),realu_pow),s(real,X1))),s(num,u_0))) = s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_18,plain,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,i(s(fun(num,real),realu_ofu_num),s(num,X1))))) = s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,X1))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
s(real,i(s(fun(real,real),i(s(fun(real,fun(real,real)),realu_mul),s(real,X1))),s(real,i(s(fun(num,real),realu_ofu_num),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X1),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))) != s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk1_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,X1))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
s(cart(real,n10),i(s(fun(cart(real,n10),cart(real,n10)),i(s(fun(real,fun(cart(real,n10),cart(real,n10))),r_),s(real,esk1_0))),s(cart(real,n10),i(s(fun(num,cart(real,n10)),vec),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) != s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.07/1.09 % Problem : GEO456+1 : TPTP v8.1.2. Released v7.0.0.
% 1.07/1.10 % Command : run_E %s %d THM
% 1.12/1.30 % Computer : n008.cluster.edu
% 1.12/1.30 % Model : x86_64 x86_64
% 1.12/1.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.12/1.30 % Memory : 8042.1875MB
% 1.12/1.30 % OS : Linux 3.10.0-693.el7.x86_64
% 1.12/1.30 % CPULimit : 300
% 1.12/1.30 % WCLimit : 300
% 1.12/1.30 % DateTime : Fri May 3 18:44:39 EDT 2024
% 1.12/1.30 % CPUTime :
% 2.12/2.37 Running first-order theorem proving
% 2.12/2.37 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.Sbp5H128VM/E---3.1_10721.p
% 182.83/23.66 # Version: 3.1.0
% 182.83/23.66 # Preprocessing class: FMLMSMSLSSSNFFN.
% 182.83/23.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 182.83/23.66 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 182.83/23.66 # Starting new_bool_3 with 600s (2) cores
% 182.83/23.66 # Starting new_bool_1 with 600s (2) cores
% 182.83/23.66 # Starting sh5l with 300s (1) cores
% 182.83/23.66 # new_bool_1 with pid 10802 completed with status 0
% 182.83/23.66 # Result found by new_bool_1
% 182.83/23.66 # Preprocessing class: FMLMSMSLSSSNFFN.
% 182.83/23.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 182.83/23.66 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 182.83/23.66 # Starting new_bool_3 with 600s (2) cores
% 182.83/23.66 # Starting new_bool_1 with 600s (2) cores
% 182.83/23.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 182.83/23.66 # Search class: FGHSM-SMLM33-DFFFFFNN
% 182.83/23.66 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 182.83/23.66 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 182.83/23.66 # Starting new_bool_1 with 61s (1) cores
% 182.83/23.66 # SAT001_MinMin_p005000_rr with pid 10806 completed with status 0
% 182.83/23.66 # Result found by SAT001_MinMin_p005000_rr
% 182.83/23.66 # Preprocessing class: FMLMSMSLSSSNFFN.
% 182.83/23.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 182.83/23.66 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 182.83/23.66 # Starting new_bool_3 with 600s (2) cores
% 182.83/23.66 # Starting new_bool_1 with 600s (2) cores
% 182.83/23.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 182.83/23.66 # Search class: FGHSM-SMLM33-DFFFFFNN
% 182.83/23.66 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 182.83/23.66 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 182.83/23.66 # Preprocessing time : 0.410 s
% 182.83/23.66 # Presaturation interreduction done
% 182.83/23.66 # SatCheck found unsatisfiable ground set
% 182.83/23.66
% 182.83/23.66 # Proof found!
% 182.83/23.66 # SZS status Theorem
% 182.83/23.66 # SZS output start CNFRefutation
% See solution above
% 182.83/23.66 # Parsed axioms : 3237
% 182.83/23.66 # Removed by relevancy pruning/SinE : 1599
% 182.83/23.66 # Initial clauses : 4833
% 182.83/23.66 # Removed in clause preprocessing : 217
% 182.83/23.66 # Initial clauses in saturation : 4616
% 182.83/23.66 # Processed clauses : 11989
% 182.83/23.66 # ...of these trivial : 113
% 182.83/23.66 # ...subsumed : 6876
% 182.83/23.66 # ...remaining for further processing : 5000
% 182.83/23.66 # Other redundant clauses eliminated : 0
% 182.83/23.66 # Clauses deleted for lack of memory : 0
% 182.83/23.66 # Backward-subsumed : 16
% 182.83/23.66 # Backward-rewritten : 104
% 182.83/23.66 # Generated clauses : 270028
% 182.83/23.66 # ...of the previous two non-redundant : 152412
% 182.83/23.66 # ...aggressively subsumed : 0
% 182.83/23.66 # Contextual simplify-reflections : 267
% 182.83/23.66 # Paramodulations : 269965
% 182.83/23.66 # Factorizations : 37
% 182.83/23.66 # NegExts : 0
% 182.83/23.66 # Equation resolutions : 26
% 182.83/23.66 # Disequality decompositions : 0
% 182.83/23.66 # Total rewrite steps : 188902
% 182.83/23.66 # ...of those cached : 131867
% 182.83/23.66 # Propositional unsat checks : 1
% 182.83/23.66 # Propositional check models : 0
% 182.83/23.66 # Propositional check unsatisfiable : 1
% 182.83/23.66 # Propositional clauses : 149335
% 182.83/23.66 # Propositional clauses after purity: 21694
% 182.83/23.66 # Propositional unsat core size : 2
% 182.83/23.66 # Propositional preprocessing time : 0.000
% 182.83/23.66 # Propositional encoding time : 1.141
% 182.83/23.66 # Propositional solver time : 0.032
% 182.83/23.66 # Success case prop preproc time : 0.000
% 182.83/23.66 # Success case prop encoding time : 1.141
% 182.83/23.66 # Success case prop solver time : 0.032
% 182.83/23.66 # Current number of processed clauses : 1032
% 182.83/23.66 # Positive orientable unit clauses : 466
% 182.83/23.66 # Positive unorientable unit clauses: 44
% 182.83/23.66 # Negative unit clauses : 69
% 182.83/23.66 # Non-unit-clauses : 453
% 182.83/23.66 # Current number of unprocessed clauses: 148303
% 182.83/23.66 # ...number of literals in the above : 332628
% 182.83/23.66 # Current number of archived formulas : 0
% 182.83/23.66 # Current number of archived clauses : 3968
% 182.83/23.66 # Clause-clause subsumption calls (NU) : 6045110
% 182.83/23.66 # Rec. Clause-clause subsumption calls : 333199
% 182.83/23.66 # Non-unit clause-clause subsumptions : 3244
% 182.83/23.66 # Unit Clause-clause subsumption calls : 2075
% 182.83/23.66 # Rewrite failures with RHS unbound : 156
% 182.83/23.66 # BW rewrite match attempts : 201048
% 182.83/23.66 # BW rewrite match successes : 569
% 182.83/23.66 # Condensation attempts : 0
% 182.83/23.66 # Condensation successes : 0
% 182.83/23.66 # Termbank termtop insertions : 32186890
% 182.83/23.66 # Search garbage collected termcells : 127369
% 182.83/23.66
% 182.83/23.66 # -------------------------------------------------
% 182.83/23.66 # User time : 20.577 s
% 182.83/23.66 # System time : 0.308 s
% 182.83/23.66 # Total time : 20.885 s
% 182.83/23.66 # Maximum resident set size: 34564 pages
% 182.83/23.66
% 182.83/23.66 # -------------------------------------------------
% 182.83/23.66 # User time : 40.807 s
% 182.83/23.66 # System time : 0.328 s
% 182.83/23.66 # Total time : 41.135 s
% 182.83/23.66 # Maximum resident set size: 11600 pages
% 182.83/23.66 % E---3.1 exiting
% 182.83/23.66 % E exiting
%------------------------------------------------------------------------------