TSTP Solution File: KLE082+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE082+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 : art03.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:54:01 EST 2010
% Result : Theorem 1.27s
% Output : Solution 1.27s
% 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/SystemOnTPTP16977/KLE082+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16977/KLE082+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16977/KLE082+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 17073
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(4, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(6, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(7, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(9, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(12, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(13, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(14, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(16, axiom,![X4]:![X5]:domain(addition(X4,X5))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', domain5)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:![X5]:(![X6]:(addition(domain(X6),antidomain(X6))=one&multiplication(domain(X6),antidomain(X6))=zero)=>addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,domain(X5))))=antidomain(multiplication(X4,domain(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:(![X6]:(addition(domain(X6),antidomain(X6))=one&multiplication(domain(X6),antidomain(X6))=zero)=>addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,domain(X5))))=antidomain(multiplication(X4,domain(X5))))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(35,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(42, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[12])).
% cnf(43,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[13])).
% cnf(45,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[14])).
% cnf(47,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X6]:![X7]:domain(addition(X6,X7))=addition(domain(X6),domain(X7)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X4]:?[X5]:(![X6]:(addition(domain(X6),antidomain(X6))=one&multiplication(domain(X6),antidomain(X6))=zero)&~(addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,domain(X5))))=antidomain(multiplication(X4,domain(X5))))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X7]:?[X8]:(![X9]:(addition(domain(X9),antidomain(X9))=one&multiplication(domain(X9),antidomain(X9))=zero)&~(addition(antidomain(multiplication(X7,X8)),antidomain(multiplication(X7,domain(X8))))=antidomain(multiplication(X7,domain(X8))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(![X9]:(addition(domain(X9),antidomain(X9))=one&multiplication(domain(X9),antidomain(X9))=zero)&~(addition(antidomain(multiplication(esk1_0,esk2_0)),antidomain(multiplication(esk1_0,domain(esk2_0))))=antidomain(multiplication(esk1_0,domain(esk2_0))))),inference(skolemize,[status(esa)],[56])).
% fof(58, negated_conjecture,![X9]:((addition(domain(X9),antidomain(X9))=one&multiplication(domain(X9),antidomain(X9))=zero)&~(addition(antidomain(multiplication(esk1_0,esk2_0)),antidomain(multiplication(esk1_0,domain(esk2_0))))=antidomain(multiplication(esk1_0,domain(esk2_0))))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,negated_conjecture,(addition(antidomain(multiplication(esk1_0,esk2_0)),antidomain(multiplication(esk1_0,domain(esk2_0))))!=antidomain(multiplication(esk1_0,domain(esk2_0)))),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(multiplication(domain(X1),antidomain(X1))=zero),inference(split_conjunct,[status(thm)],[58])).
% cnf(61,negated_conjecture,(addition(domain(X1),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[58])).
% cnf(68,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[25,21,theory(equality)])).
% cnf(70,plain,(leq(X1,X2)|addition(X2,X1)!=X2),inference(spm,[status(thm)],[53,21,theory(equality)])).
% cnf(74,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[47,21,theory(equality)])).
% cnf(87,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,27,theory(equality)])).
% cnf(117,plain,(addition(domain(addition(X1,X2)),X3)=addition(domain(X1),addition(domain(X2),X3))),inference(spm,[status(thm)],[23,50,theory(equality)])).
% cnf(131,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[45,33,theory(equality)])).
% cnf(137,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[131,33,theory(equality)])).
% cnf(146,plain,(addition(one,domain(one))=domain(one)),inference(spm,[status(thm)],[43,31,theory(equality)])).
% cnf(160,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(193,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[37,33,theory(equality)])).
% cnf(198,negated_conjecture,(addition(zero,multiplication(X2,antidomain(X1)))=multiplication(addition(domain(X1),X2),antidomain(X1))),inference(spm,[status(thm)],[37,60,theory(equality)])).
% cnf(242,negated_conjecture,(addition(domain(X1),antidomain(domain(X1)))=one),inference(spm,[status(thm)],[61,137,theory(equality)])).
% cnf(263,plain,(one=domain(one)),inference(rw,[status(thm)],[146,74,theory(equality)])).
% cnf(270,plain,(addition(domain(X1),one)=domain(addition(X1,one))),inference(spm,[status(thm)],[50,263,theory(equality)])).
% cnf(277,plain,(one=domain(addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[270,21,theory(equality)]),74,theory(equality)])).
% cnf(319,plain,(domain(multiplication(X1,one))=domain(multiplication(X1,addition(X2,one)))),inference(spm,[status(thm)],[45,277,theory(equality)])).
% cnf(333,plain,(domain(X1)=domain(multiplication(X1,addition(X2,one)))),inference(rw,[status(thm)],[319,31,theory(equality)])).
% cnf(476,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,87,theory(equality)])).
% cnf(532,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[476,21,theory(equality)])).
% cnf(544,negated_conjecture,(leq(antidomain(X1),one)),inference(spm,[status(thm)],[532,61,theory(equality)])).
% cnf(617,negated_conjecture,(addition(antidomain(X1),one)=one),inference(spm,[status(thm)],[54,544,theory(equality)])).
% cnf(626,negated_conjecture,(addition(one,antidomain(X1))=one),inference(rw,[status(thm)],[617,21,theory(equality)])).
% cnf(1301,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[160,21,theory(equality)])).
% cnf(1317,plain,(leq(multiplication(X1,X2),X1)|multiplication(X1,addition(X2,one))!=X1),inference(spm,[status(thm)],[70,1301,theory(equality)])).
% cnf(1584,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[193,21,theory(equality)])).
% cnf(1617,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[43,1584,theory(equality)]),21,theory(equality)]),74,theory(equality)]),33,theory(equality)])).
% cnf(3581,negated_conjecture,(addition(domain(X1),one)=addition(domain(addition(X1,X2)),antidomain(X2))),inference(spm,[status(thm)],[117,61,theory(equality)])).
% cnf(3651,negated_conjecture,(one=addition(domain(addition(X1,X2)),antidomain(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3581,21,theory(equality)]),74,theory(equality)])).
% cnf(3682,plain,(leq(multiplication(X1,X2),X1)|multiplication(X1,addition(one,X2))!=X1),inference(spm,[status(thm)],[1317,21,theory(equality)])).
% cnf(6204,negated_conjecture,(leq(multiplication(X1,antidomain(X2)),X1)|multiplication(X1,one)!=X1),inference(spm,[status(thm)],[3682,626,theory(equality)])).
% cnf(6233,negated_conjecture,(leq(multiplication(X1,antidomain(X2)),X1)|$false),inference(rw,[status(thm)],[6204,31,theory(equality)])).
% cnf(6234,negated_conjecture,(leq(multiplication(X1,antidomain(X2)),X1)),inference(cn,[status(thm)],[6233,theory(equality)])).
% cnf(7263,negated_conjecture,(addition(antidomain(X2),domain(addition(X1,X2)))=one),inference(rw,[status(thm)],[3651,21,theory(equality)])).
% cnf(7323,negated_conjecture,(addition(antidomain(multiplication(X1,X2)),domain(multiplication(X1,addition(X2,one))))=one),inference(spm,[status(thm)],[7263,1301,theory(equality)])).
% cnf(7402,negated_conjecture,(addition(antidomain(multiplication(X1,X2)),domain(X1))=one),inference(rw,[status(thm)],[7323,333,theory(equality)])).
% cnf(10209,negated_conjecture,(multiplication(addition(domain(X1),X2),antidomain(X1))=multiplication(X2,antidomain(X1))),inference(rw,[status(thm)],[198,68,theory(equality)])).
% cnf(10271,negated_conjecture,(multiplication(one,antidomain(X1))=multiplication(antidomain(domain(X1)),antidomain(X1))),inference(spm,[status(thm)],[10209,242,theory(equality)])).
% cnf(10350,negated_conjecture,(antidomain(X1)=multiplication(antidomain(domain(X1)),antidomain(X1))),inference(rw,[status(thm)],[10271,33,theory(equality)])).
% cnf(10524,negated_conjecture,(addition(antidomain(domain(X1)),antidomain(X1))=multiplication(antidomain(domain(X1)),addition(antidomain(X1),one))),inference(spm,[status(thm)],[1301,10350,theory(equality)])).
% cnf(10567,negated_conjecture,(addition(antidomain(domain(X1)),antidomain(X1))=antidomain(domain(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[10524,21,theory(equality)]),626,theory(equality)]),31,theory(equality)])).
% cnf(10665,negated_conjecture,(addition(domain(X1),antidomain(multiplication(X1,X2)))=one),inference(rw,[status(thm)],[7402,21,theory(equality)])).
% cnf(10713,negated_conjecture,(multiplication(one,antidomain(X1))=multiplication(antidomain(multiplication(X1,X2)),antidomain(X1))),inference(spm,[status(thm)],[10209,10665,theory(equality)])).
% cnf(10801,negated_conjecture,(antidomain(X1)=multiplication(antidomain(multiplication(X1,X2)),antidomain(X1))),inference(rw,[status(thm)],[10713,33,theory(equality)])).
% cnf(11052,negated_conjecture,(addition(antidomain(X1),antidomain(domain(X1)))=antidomain(domain(X1))),inference(rw,[status(thm)],[10567,21,theory(equality)])).
% cnf(17055,negated_conjecture,(leq(antidomain(X1),antidomain(multiplication(X1,X2)))),inference(spm,[status(thm)],[6234,10801,theory(equality)])).
% cnf(17173,negated_conjecture,(leq(antidomain(domain(X1)),antidomain(X1))),inference(spm,[status(thm)],[17055,1617,theory(equality)])).
% cnf(17234,negated_conjecture,(addition(antidomain(domain(X1)),antidomain(X1))=antidomain(X1)),inference(spm,[status(thm)],[54,17173,theory(equality)])).
% cnf(17276,negated_conjecture,(antidomain(domain(X1))=antidomain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[17234,21,theory(equality)]),11052,theory(equality)])).
% cnf(17362,negated_conjecture,(antidomain(domain(multiplication(X1,X2)))=antidomain(multiplication(X1,domain(X2)))),inference(spm,[status(thm)],[17276,45,theory(equality)])).
% cnf(17458,negated_conjecture,(antidomain(multiplication(X1,X2))=antidomain(multiplication(X1,domain(X2)))),inference(rw,[status(thm)],[17362,17276,theory(equality)])).
% cnf(17586,negated_conjecture,(antidomain(multiplication(esk1_0,esk2_0))!=antidomain(multiplication(esk1_0,domain(esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[59,17458,theory(equality)]),27,theory(equality)])).
% cnf(17587,negated_conjecture,($false),inference(rw,[status(thm)],[17586,17458,theory(equality)])).
% cnf(17588,negated_conjecture,($false),inference(cn,[status(thm)],[17587,theory(equality)])).
% cnf(17589,negated_conjecture,($false),17588,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 918
% # ...of these trivial : 240
% # ...subsumed : 452
% # ...remaining for further processing: 226
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 27
% # Generated clauses : 9298
% # ...of the previous two non-trivial : 4785
% # Contextual simplify-reflections : 0
% # Paramodulations : 9297
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 199
% # Positive orientable unit clauses: 148
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 48
% # Current number of unprocessed clauses: 3250
% # ...number of literals in the above : 4250
% # Clause-clause subsumption calls (NU) : 1413
% # Rec. Clause-clause subsumption calls : 1413
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 142
% # Indexed BW rewrite successes : 46
% # Backwards rewriting index: 187 leaves, 1.56+/-1.219 terms/leaf
% # Paramod-from index: 115 leaves, 1.33+/-0.872 terms/leaf
% # Paramod-into index: 160 leaves, 1.52+/-1.140 terms/leaf
% # -------------------------------------------------
% # User time : 0.192 s
% # System time : 0.007 s
% # Total time : 0.199 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.47 CPU 0.56 WC
% FINAL PrfWatch: 0.47 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP16977/KLE082+1.tptp
%
%------------------------------------------------------------------------------