TSTP Solution File: KLE027+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE027+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 07:36:31 EST 2010
% Result : Theorem 20.43s
% Output : Solution 20.43s
% 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/SystemOnTPTP9228/KLE027+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9228/KLE027+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9228/KLE027+2.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 9324
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.86 CPU 10.03 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.85 CPU 12.03 WC
% PrfWatch: 13.84 CPU 14.04 WC
% PrfWatch: 15.83 CPU 16.04 WC
% PrfWatch: 17.83 CPU 18.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(2, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(3, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(4, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(6, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(9, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(11, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(13, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(15, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(17, conjecture,![X4]:![X5]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>(leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))&leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>(leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))&leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)))))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(39, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[9])).
% fof(40, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[40])).
% cnf(43,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[41])).
% fof(50, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(51,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[50])).
% fof(54, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[13])).
% cnf(55,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[54])).
% fof(58, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(59,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:((~(complement(X5,X4))|((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one))&(((~(multiplication(X4,X5)=zero)|~(multiplication(X5,X4)=zero))|~(addition(X4,X5)=one))|complement(X5,X4))),inference(fof_nnf,[status(thm)],[16])).
% fof(61, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[61])).
% cnf(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:?[X7]:?[X8]:((test(X7)&test(X8))&(~(leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6))))|~(leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:((test(X12)&test(X13))&(~(leq(addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)),addition(multiplication(X12,X9),multiplication(c(X12),X11))))|~(leq(addition(multiplication(X12,X9),multiplication(c(X12),X11)),addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk5_0)&test(esk6_0))&(~(leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))))|~(leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))|~leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(test(esk5_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(74,plain,(leq(X1,X1)),inference(spm,[status(thm)],[22,33,theory(equality)])).
% cnf(75,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(125,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[70,29,theory(equality)])).
% cnf(126,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[125,29,theory(equality)])).
% cnf(219,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[64,75,theory(equality)])).
% cnf(220,plain,(multiplication(c(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[66,75,theory(equality)])).
% cnf(221,plain,(multiplication(X1,c(X1))=zero|~test(X1)),inference(spm,[status(thm)],[65,75,theory(equality)])).
% cnf(2996,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[219,29,theory(equality)])).
% cnf(6758,negated_conjecture,(multiplication(c(esk5_0),esk5_0)=zero),inference(spm,[status(thm)],[220,72,theory(equality)])).
% cnf(6831,negated_conjecture,(addition(multiplication(X1,esk5_0),zero)=multiplication(addition(X1,c(esk5_0)),esk5_0)),inference(spm,[status(thm)],[27,6758,theory(equality)])).
% cnf(6849,negated_conjecture,(multiplication(X1,esk5_0)=multiplication(addition(X1,c(esk5_0)),esk5_0)),inference(rw,[status(thm)],[6831,51,theory(equality)])).
% cnf(7143,negated_conjecture,(multiplication(esk5_0,c(esk5_0))=zero),inference(spm,[status(thm)],[221,72,theory(equality)])).
% cnf(7206,negated_conjecture,(multiplication(zero,X1)=multiplication(esk5_0,multiplication(c(esk5_0),X1))),inference(spm,[status(thm)],[35,7143,theory(equality)])).
% cnf(7224,negated_conjecture,(zero=multiplication(esk5_0,multiplication(c(esk5_0),X1))),inference(rw,[status(thm)],[7206,55,theory(equality)])).
% cnf(7460,negated_conjecture,(addition(multiplication(esk5_0,X1),zero)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(spm,[status(thm)],[25,7224,theory(equality)])).
% cnf(7490,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(rw,[status(thm)],[7460,51,theory(equality)])).
% cnf(8957,negated_conjecture,(multiplication(one,esk5_0)=multiplication(esk5_0,esk5_0)|~test(esk5_0)),inference(spm,[status(thm)],[6849,2996,theory(equality)])).
% cnf(8989,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)|~test(esk5_0)),inference(rw,[status(thm)],[8957,59,theory(equality)])).
% cnf(8990,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)|$false),inference(rw,[status(thm)],[8989,72,theory(equality)])).
% cnf(8991,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)),inference(cn,[status(thm)],[8990,theory(equality)])).
% cnf(8993,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,multiplication(esk5_0,X1))),inference(spm,[status(thm)],[35,8991,theory(equality)])).
% cnf(9023,negated_conjecture,(addition(multiplication(esk5_0,X1),multiplication(esk5_0,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(spm,[status(thm)],[25,8993,theory(equality)])).
% cnf(9053,negated_conjecture,(multiplication(esk5_0,addition(X1,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(rw,[status(thm)],[9023,25,theory(equality)])).
% cnf(125584,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[126,9053,theory(equality)])).
% cnf(125585,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[125584,9053,theory(equality)])).
% cnf(707389,negated_conjecture,($false|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[125585,7490,theory(equality)]),29,theory(equality)]),74,theory(equality)])).
% cnf(707390,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[707389,7490,theory(equality)]),29,theory(equality)]),74,theory(equality)])).
% cnf(707391,negated_conjecture,($false),inference(cn,[status(thm)],[707390,theory(equality)])).
% cnf(707392,negated_conjecture,($false),707391,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19029
% # ...of these trivial : 2534
% # ...subsumed : 14253
% # ...remaining for further processing: 2242
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 54
% # Backward-rewritten : 371
% # Generated clauses : 325063
% # ...of the previous two non-trivial : 215867
% # Contextual simplify-reflections : 776
% # Paramodulations : 325008
% # Factorizations : 4
% # Equation resolutions : 51
% # Current number of processed clauses: 1817
% # Positive orientable unit clauses: 786
% # Positive unorientable unit clauses: 15
% # Negative unit clauses : 0
% # Non-unit-clauses : 1016
% # Current number of unprocessed clauses: 175951
% # ...number of literals in the above : 360041
% # Clause-clause subsumption calls (NU) : 108201
% # Rec. Clause-clause subsumption calls : 105967
% # Unit Clause-clause subsumption calls : 628
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2811
% # Indexed BW rewrite successes : 488
% # Backwards rewriting index: 1125 leaves, 1.89+/-2.198 terms/leaf
% # Paramod-from index: 603 leaves, 1.67+/-1.315 terms/leaf
% # Paramod-into index: 803 leaves, 1.83+/-1.813 terms/leaf
% # -------------------------------------------------
% # User time : 9.901 s
% # System time : 0.405 s
% # Total time : 10.306 s
% # Maximum resident set size: 0 pages
% PrfWatch: 19.59 CPU 19.83 WC
% FINAL PrfWatch: 19.59 CPU 19.83 WC
% SZS output end Solution for /tmp/SystemOnTPTP9228/KLE027+2.tptp
%
%------------------------------------------------------------------------------