TSTP Solution File: KLE039+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE039+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 07:47:59 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP15767/KLE039+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15767/KLE039+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15767/KLE039+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 15899
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X2)=>leq(multiplication(star(X1),X3),X2)),file('/tmp/SRASS.s.p', star_induction_left)).
% fof(6, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X1)=>leq(multiplication(X3,star(X2)),X1)),file('/tmp/SRASS.s.p', star_induction_right)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(9, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(11, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(12, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(13, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(17, conjecture,![X4]:star(star(X4))=star(X4),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:star(star(X4))=star(X4)),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X2))|leq(multiplication(star(X1),X3),X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(28, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X5))|leq(multiplication(star(X4),X6),X5)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(leq(multiplication(star(X1),X2),X3)|~leq(addition(multiplication(X1,X3),X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(31, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(36,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(42, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(45, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(46,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(55, negated_conjecture,?[X4]:~(star(star(X4))=star(X4)),inference(fof_nnf,[status(thm)],[18])).
% fof(56, negated_conjecture,?[X5]:~(star(star(X5))=star(X5)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(star(star(esk1_0))=star(esk1_0)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(star(star(esk1_0))!=star(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(71,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[22,24,theory(equality)])).
% cnf(98,plain,(leq(X1,X1)),inference(spm,[status(thm)],[43,24,theory(equality)])).
% cnf(105,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[32,46,theory(equality)])).
% cnf(107,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[32,24,theory(equality)])).
% cnf(111,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[107,26,theory(equality)])).
% cnf(133,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[34,46,theory(equality)])).
% cnf(163,plain,(leq(multiplication(star(X1),multiplication(X2,X3)),X3)|~leq(multiplication(addition(X1,X2),X3),X3)),inference(spm,[status(thm)],[29,36,theory(equality)])).
% cnf(166,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[36,48,theory(equality)])).
% cnf(191,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[44,38,theory(equality)])).
% cnf(193,plain,(leq(addition(one,star(one)),star(one))),inference(spm,[status(thm)],[38,48,theory(equality)])).
% cnf(195,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[191,22,theory(equality)])).
% cnf(259,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[43,71,theory(equality)])).
% cnf(332,plain,(addition(addition(one,star(one)),star(one))=star(one)),inference(spm,[status(thm)],[44,193,theory(equality)])).
% cnf(333,plain,(addition(one,star(one))=star(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[332,22,theory(equality)]),24,theory(equality)])).
% cnf(1262,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[133,20,theory(equality)])).
% cnf(1365,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[166,20,theory(equality)])).
% cnf(1380,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[259,1365,theory(equality)])).
% cnf(2717,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[105,24,theory(equality)])).
% cnf(2732,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[2717,98,theory(equality)])).
% cnf(2733,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[2732,theory(equality)])).
% cnf(2737,plain,(leq(star(one),one)),inference(spm,[status(thm)],[2733,48,theory(equality)])).
% cnf(2745,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[44,2737,theory(equality)])).
% cnf(2747,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2745,20,theory(equality)]),333,theory(equality)])).
% cnf(2781,plain,(leq(X1,X2)|~leq(addition(X2,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[105,2747,theory(equality)]),46,theory(equality)])).
% cnf(3133,plain,(leq(X1,X2)|~leq(addition(X1,X2),X2)),inference(spm,[status(thm)],[2781,20,theory(equality)])).
% cnf(7875,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,20,theory(equality)]),1365,theory(equality)])).
% cnf(7879,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[71,7875,theory(equality)])).
% cnf(7885,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|~leq(star(X1),multiplication(addition(X1,one),star(X1)))),inference(spm,[status(thm)],[3133,7875,theory(equality)])).
% cnf(7978,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|$false),inference(rw,[status(thm)],[7885,1380,theory(equality)])).
% cnf(7979,plain,(leq(one,multiplication(addition(X1,one),star(X1)))),inference(cn,[status(thm)],[7978,theory(equality)])).
% cnf(9027,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=multiplication(addition(X1,one),star(X1))),inference(spm,[status(thm)],[44,7979,theory(equality)])).
% cnf(9035,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[9027,7875,theory(equality)])).
% cnf(9046,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(spm,[status(thm)],[1262,9035,theory(equality)])).
% cnf(9087,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[9035,20,theory(equality)])).
% cnf(9095,plain,(addition(X1,star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[9046,22,theory(equality)]),7879,theory(equality)])).
% cnf(9096,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[9095,20,theory(equality)]),7879,theory(equality)]),9035,theory(equality)])).
% cnf(10015,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[9087,7879,theory(equality)])).
% cnf(10918,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[163,9035,theory(equality)])).
% cnf(10959,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[10918,48,theory(equality)])).
% cnf(10960,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[10959,98,theory(equality)])).
% cnf(10961,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[10960,theory(equality)])).
% cnf(18043,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[111,10961,theory(equality)])).
% cnf(18051,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18043,10015,theory(equality)]),10015,theory(equality)])).
% cnf(18058,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[44,18051,theory(equality)])).
% cnf(18077,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[18058,20,theory(equality)]),9096,theory(equality)])).
% cnf(18185,negated_conjecture,($false),inference(rw,[status(thm)],[58,18077,theory(equality)])).
% cnf(18186,negated_conjecture,($false),inference(cn,[status(thm)],[18185,theory(equality)])).
% cnf(18187,negated_conjecture,($false),18186,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1050
% # ...of these trivial : 346
% # ...subsumed : 389
% # ...remaining for further processing: 315
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 88
% # Generated clauses : 10640
% # ...of the previous two non-trivial : 6393
% # Contextual simplify-reflections : 0
% # Paramodulations : 10639
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 153
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 71
% # Current number of unprocessed clauses: 4045
% # ...number of literals in the above : 5705
% # Clause-clause subsumption calls (NU) : 2793
% # Rec. Clause-clause subsumption calls : 2793
% # Unit Clause-clause subsumption calls : 91
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 487
% # Indexed BW rewrite successes : 55
% # Backwards rewriting index: 180 leaves, 2.16+/-1.719 terms/leaf
% # Paramod-from index: 87 leaves, 1.82+/-1.572 terms/leaf
% # Paramod-into index: 154 leaves, 2.17+/-1.772 terms/leaf
% # -------------------------------------------------
% # User time : 0.211 s
% # System time : 0.013 s
% # Total time : 0.224 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.48 CPU 0.56 WC
% FINAL PrfWatch: 0.48 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP15767/KLE039+1.tptp
%
%------------------------------------------------------------------------------