TSTP Solution File: KLE140+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE140+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 08:11:09 EST 2010
% Result : Theorem 25.25s
% Output : Solution 25.25s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP16733/KLE140+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16733/KLE140+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16733/KLE140+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 16829
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.91 CPU 4.04 WC
% PrfWatch: 5.91 CPU 6.04 WC
% PrfWatch: 7.89 CPU 8.05 WC
% PrfWatch: 9.88 CPU 10.06 WC
% PrfWatch: 11.86 CPU 12.07 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.83 CPU 14.07 WC
% PrfWatch: 15.82 CPU 16.08 WC
% PrfWatch: 17.46 CPU 18.09 WC
% PrfWatch: 19.07 CPU 20.09 WC
% PrfWatch: 21.06 CPU 22.10 WC
% PrfWatch: 23.05 CPU 24.11 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(2, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(3, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(4, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(5, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(9, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(10, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(19, conjecture,![X4]:![X5]:(leq(X4,X5)=>leq(strong_iteration(X4),strong_iteration(X5))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:(leq(X4,X5)=>leq(strong_iteration(X4),strong_iteration(X5)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(22, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(29,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(33,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(43,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(54, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[15])).
% cnf(55,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[54])).
% fof(62, negated_conjecture,?[X4]:?[X5]:(leq(X4,X5)&~(leq(strong_iteration(X4),strong_iteration(X5)))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X6]:?[X7]:(leq(X6,X7)&~(leq(strong_iteration(X6),strong_iteration(X7)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(leq(esk1_0,esk2_0)&~(leq(strong_iteration(esk1_0),strong_iteration(esk2_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(strong_iteration(esk1_0),strong_iteration(esk2_0))),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(leq(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[64])).
% cnf(77,negated_conjecture,(addition(esk1_0,esk2_0)=esk2_0),inference(spm,[status(thm)],[27,66,theory(equality)])).
% cnf(106,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[31,33,theory(equality)])).
% cnf(114,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[55,29,theory(equality)])).
% cnf(116,plain,(addition(strong_iteration(X1),X2)=addition(one,addition(multiplication(X1,strong_iteration(X1)),X2))),inference(spm,[status(thm)],[31,114,theory(equality)])).
% cnf(127,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(X3,multiplication(X2,X1)))),inference(spm,[status(thm)],[23,29,theory(equality)])).
% cnf(190,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[37,43,theory(equality)])).
% cnf(250,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[26,106,theory(equality)])).
% cnf(942,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[190,29,theory(equality)])).
% cnf(955,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[250,942,theory(equality)])).
% cnf(3419,plain,(addition(one,multiplication(addition(X1,X2),strong_iteration(X1)))=addition(strong_iteration(X1),multiplication(X2,strong_iteration(X1)))),inference(spm,[status(thm)],[116,37,theory(equality)])).
% cnf(3450,plain,(addition(one,multiplication(addition(X1,X2),strong_iteration(X1)))=multiplication(addition(X2,one),strong_iteration(X1))),inference(rw,[status(thm)],[3419,942,theory(equality)])).
% cnf(923363,plain,(leq(strong_iteration(X1),multiplication(strong_iteration(addition(X1,X2)),one))|~leq(strong_iteration(X1),multiplication(addition(X2,one),strong_iteration(X1)))),inference(spm,[status(thm)],[127,3450,theory(equality)])).
% cnf(924386,plain,(leq(strong_iteration(X1),strong_iteration(addition(X1,X2)))|~leq(strong_iteration(X1),multiplication(addition(X2,one),strong_iteration(X1)))),inference(rw,[status(thm)],[923363,41,theory(equality)])).
% cnf(924387,plain,(leq(strong_iteration(X1),strong_iteration(addition(X1,X2)))|$false),inference(rw,[status(thm)],[924386,955,theory(equality)])).
% cnf(924388,plain,(leq(strong_iteration(X1),strong_iteration(addition(X1,X2)))),inference(cn,[status(thm)],[924387,theory(equality)])).
% cnf(925509,negated_conjecture,(leq(strong_iteration(esk1_0),strong_iteration(esk2_0))),inference(spm,[status(thm)],[924388,77,theory(equality)])).
% cnf(926132,negated_conjecture,($false),inference(sr,[status(thm)],[925509,65,theory(equality)])).
% cnf(926133,negated_conjecture,($false),926132,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18307
% # ...of these trivial : 5479
% # ...subsumed : 9405
% # ...remaining for further processing: 3423
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 766
% # Generated clauses : 505654
% # ...of the previous two non-trivial : 266086
% # Contextual simplify-reflections : 0
% # Paramodulations : 505652
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 2642
% # Positive orientable unit clauses: 2123
% # Positive unorientable unit clauses: 14
% # Negative unit clauses : 3
% # Non-unit-clauses : 502
% # Current number of unprocessed clauses: 198090
% # ...number of literals in the above : 289111
% # Clause-clause subsumption calls (NU) : 59845
% # Rec. Clause-clause subsumption calls : 59845
% # Unit Clause-clause subsumption calls : 1377
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14062
% # Indexed BW rewrite successes : 724
% # Backwards rewriting index: 1825 leaves, 2.12+/-2.388 terms/leaf
% # Paramod-from index: 1049 leaves, 2.05+/-2.386 terms/leaf
% # Paramod-into index: 1604 leaves, 2.14+/-2.445 terms/leaf
% # -------------------------------------------------
% # User time : 12.877 s
% # System time : 0.552 s
% # Total time : 13.429 s
% # Maximum resident set size: 0 pages
% PrfWatch: 24.22 CPU 25.28 WC
% FINAL PrfWatch: 24.22 CPU 25.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP16733/KLE140+1.tptp
%
%------------------------------------------------------------------------------