TSTP Solution File: GEO454+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO454+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : 600s
% DateTime : Sat Jul 16 04:05:52 EDT 2022
% Result : Theorem 0.97s 2.14s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(adrop,axiom,
! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',adrop) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aNUMERAL) ).
fof(aLIFTu_DROPu_conjunct1,conjecture,
! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aLIFTu_DROPu_conjunct1) ).
fof(aLIFTu_COMPONENT,axiom,
! [X1] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))),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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aLIFTu_COMPONENT) ).
fof(c_0_4,plain,
! [X2] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X2))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X2))),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)],[adrop]) ).
fof(c_0_5,plain,
! [X85] : s(num,i(s(fun(num,num),numeral),s(num,X85))) = s(num,X85),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] : s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
inference(assume_negation,[status(cth)],[aLIFTu_DROPu_conjunct1]) ).
fof(c_0_7,plain,
! [X2] : s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X2))))),s(num,i(s(fun(num,num),numeral),s(num,i(s(fun(num,num),bit1),s(num,u_0))))))) = s(real,X2),
inference(variable_rename,[status(thm)],[aLIFTu_COMPONENT]) ).
cnf(c_0_8,plain,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))) = s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),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_4]) ).
cnf(c_0_9,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))))) != s(real,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))),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_7]) ).
cnf(c_0_12,plain,
s(real,i(s(fun(num,real),i(s(fun(cart(real,n10),fun(num,real)),d_),s(cart(real,n10),X1))),s(num,i(s(fun(num,num),bit1),s(num,u_0))))) = s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),X1))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,esk1_0))))) != s(real,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
s(real,i(s(fun(cart(real,n10),real),drop),s(cart(real,n10),i(s(fun(real,cart(real,n10)),lift),s(real,X1))))) = s(real,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO454+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 16:34:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.97/2.14 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.97/2.14 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.97/2.14 # Preprocessing time : 0.380 s
% 0.97/2.14
% 0.97/2.14 # Proof found!
% 0.97/2.14 # SZS status Theorem
% 0.97/2.14 # SZS output start CNFRefutation
% See solution above
% 0.97/2.14 # Proof object total steps : 16
% 0.97/2.14 # Proof object clause steps : 7
% 0.97/2.14 # Proof object formula steps : 9
% 0.97/2.14 # Proof object conjectures : 5
% 0.97/2.14 # Proof object clause conjectures : 2
% 0.97/2.14 # Proof object formula conjectures : 3
% 0.97/2.14 # Proof object initial clauses used : 4
% 0.97/2.14 # Proof object initial formulas used : 4
% 0.97/2.14 # Proof object generating inferences : 0
% 0.97/2.14 # Proof object simplifying inferences : 5
% 0.97/2.14 # Training examples: 0 positive, 0 negative
% 0.97/2.14 # Parsed axioms : 3209
% 0.97/2.14 # Removed by relevancy pruning/SinE : 3108
% 0.97/2.14 # Initial clauses : 330
% 0.97/2.14 # Removed in clause preprocessing : 112
% 0.97/2.14 # Initial clauses in saturation : 218
% 0.97/2.14 # Processed clauses : 18
% 0.97/2.14 # ...of these trivial : 1
% 0.97/2.14 # ...subsumed : 0
% 0.97/2.14 # ...remaining for further processing : 17
% 0.97/2.14 # Other redundant clauses eliminated : 0
% 0.97/2.14 # Clauses deleted for lack of memory : 0
% 0.97/2.14 # Backward-subsumed : 0
% 0.97/2.14 # Backward-rewritten : 1
% 0.97/2.14 # Generated clauses : 67
% 0.97/2.14 # ...of the previous two non-trivial : 36
% 0.97/2.14 # Contextual simplify-reflections : 0
% 0.97/2.14 # Paramodulations : 67
% 0.97/2.14 # Factorizations : 0
% 0.97/2.14 # Equation resolutions : 0
% 0.97/2.14 # Current number of processed clauses : 16
% 0.97/2.14 # Positive orientable unit clauses : 8
% 0.97/2.14 # Positive unorientable unit clauses: 1
% 0.97/2.14 # Negative unit clauses : 0
% 0.97/2.14 # Non-unit-clauses : 7
% 0.97/2.14 # Current number of unprocessed clauses: 236
% 0.97/2.14 # ...number of literals in the above : 944
% 0.97/2.14 # Current number of archived formulas : 0
% 0.97/2.14 # Current number of archived clauses : 1
% 0.97/2.14 # Clause-clause subsumption calls (NU) : 12
% 0.97/2.14 # Rec. Clause-clause subsumption calls : 9
% 0.97/2.14 # Non-unit clause-clause subsumptions : 0
% 0.97/2.14 # Unit Clause-clause subsumption calls : 0
% 0.97/2.14 # Rewrite failures with RHS unbound : 0
% 0.97/2.14 # BW rewrite match attempts : 12
% 0.97/2.14 # BW rewrite match successes : 1
% 0.97/2.14 # Condensation attempts : 0
% 0.97/2.14 # Condensation successes : 0
% 0.97/2.14 # Termbank termtop insertions : 450132
% 0.97/2.14
% 0.97/2.14 # -------------------------------------------------
% 0.97/2.14 # User time : 0.373 s
% 0.97/2.14 # System time : 0.010 s
% 0.97/2.14 # Total time : 0.383 s
% 0.97/2.14 # Maximum resident set size: 17136 pages
%------------------------------------------------------------------------------