TSTP Solution File: KLE114+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE114+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:01:56 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP9896/KLE114+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9896/KLE114+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9896/KLE114+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 9992
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(2, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(3, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(7, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(10, axiom,![X4]:addition(coantidomain(coantidomain(X4)),coantidomain(X4))=one,file('/tmp/SRASS.s.p', codomain3)).
% fof(11, axiom,![X4]:![X5]:forward_box(X4,X5)=c(forward_diamond(X4,c(X5))),file('/tmp/SRASS.s.p', forward_box)).
% fof(12, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(16, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(17, axiom,![X4]:![X5]:forward_diamond(X4,X5)=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', forward_diamond)).
% fof(18, axiom,![X4]:multiplication(X4,coantidomain(X4))=zero,file('/tmp/SRASS.s.p', codomain1)).
% fof(19, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(20, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(21, axiom,![X1]:multiplication(X1,zero)=zero,file('/tmp/SRASS.s.p', right_annihilation)).
% fof(23, axiom,![X4]:c(X4)=antidomain(domain(X4)),file('/tmp/SRASS.s.p', complement)).
% fof(27, conjecture,![X4]:forward_box(X4,one)=one,file('/tmp/SRASS.s.p', goals)).
% fof(28, negated_conjecture,~(![X4]:forward_box(X4,one)=one),inference(assume_negation,[status(cth)],[27])).
% fof(29, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(30,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(32,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(34,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(39, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[6])).
% cnf(40,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[7])).
% cnf(42,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[41])).
% fof(47, plain,![X5]:addition(coantidomain(coantidomain(X5)),coantidomain(X5))=one,inference(variable_rename,[status(thm)],[10])).
% cnf(48,plain,(addition(coantidomain(coantidomain(X1)),coantidomain(X1))=one),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X6]:![X7]:forward_box(X6,X7)=c(forward_diamond(X6,c(X7))),inference(variable_rename,[status(thm)],[11])).
% cnf(50,plain,(forward_box(X1,X2)=c(forward_diamond(X1,c(X2)))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[12])).
% cnf(52,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[51])).
% fof(59, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(60,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X6]:![X7]:forward_diamond(X6,X7)=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[17])).
% cnf(62,plain,(forward_diamond(X1,X2)=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X5]:multiplication(X5,coantidomain(X5))=zero,inference(variable_rename,[status(thm)],[18])).
% cnf(64,plain,(multiplication(X1,coantidomain(X1))=zero),inference(split_conjunct,[status(thm)],[63])).
% fof(65, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[19])).
% fof(66, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(69, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[20])).
% cnf(70,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[69])).
% fof(71, plain,![X2]:multiplication(X2,zero)=zero,inference(variable_rename,[status(thm)],[21])).
% cnf(72,plain,(multiplication(X1,zero)=zero),inference(split_conjunct,[status(thm)],[71])).
% fof(75, plain,![X5]:c(X5)=antidomain(domain(X5)),inference(variable_rename,[status(thm)],[23])).
% cnf(76,plain,(c(X1)=antidomain(domain(X1))),inference(split_conjunct,[status(thm)],[75])).
% fof(83, negated_conjecture,?[X4]:~(forward_box(X4,one)=one),inference(fof_nnf,[status(thm)],[28])).
% fof(84, negated_conjecture,?[X5]:~(forward_box(X5,one)=one),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,~(forward_box(esk1_0,one)=one),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(forward_box(esk1_0,one)!=one),inference(split_conjunct,[status(thm)],[85])).
% cnf(87,plain,(antidomain(antidomain(antidomain(X1)))=c(X1)),inference(rw,[status(thm)],[76,52,theory(equality)]),['unfolding']).
% cnf(88,plain,(antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2)))))=forward_diamond(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[62,52,theory(equality)]),52,theory(equality)]),['unfolding']).
% cnf(90,plain,(antidomain(antidomain(antidomain(forward_diamond(X1,antidomain(antidomain(antidomain(X2)))))))=forward_box(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,87,theory(equality)]),87,theory(equality)]),['unfolding']).
% cnf(93,negated_conjecture,(antidomain(antidomain(antidomain(forward_diamond(esk1_0,antidomain(antidomain(antidomain(one)))))))!=one),inference(rw,[status(thm)],[86,90,theory(equality)]),['unfolding']).
% cnf(94,negated_conjecture,(antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(antidomain(one)))))))))))!=one),inference(rw,[status(thm)],[93,88,theory(equality)]),['unfolding']).
% cnf(177,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[60,34,theory(equality)])).
% cnf(189,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[42,34,theory(equality)])).
% cnf(199,plain,(leq(zero,X1)),inference(spm,[status(thm)],[67,177,theory(equality)])).
% cnf(209,plain,(leq(multiplication(antidomain(X2),X2),X1)),inference(spm,[status(thm)],[199,70,theory(equality)])).
% cnf(215,plain,(leq(antidomain(one),X1)),inference(spm,[status(thm)],[209,30,theory(equality)])).
% cnf(219,plain,(addition(antidomain(one),X1)=X1),inference(spm,[status(thm)],[68,215,theory(equality)])).
% cnf(220,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[60,219,theory(equality)])).
% cnf(221,plain,(X1=addition(X1,antidomain(one))),inference(spm,[status(thm)],[34,219,theory(equality)])).
% cnf(234,plain,(multiplication(X1,antidomain(one))=zero),inference(rw,[status(thm)],[72,220,theory(equality)])).
% cnf(235,plain,(multiplication(X1,antidomain(one))=antidomain(one)),inference(rw,[status(thm)],[234,220,theory(equality)])).
% cnf(236,plain,(multiplication(X1,coantidomain(X1))=antidomain(one)),inference(rw,[status(thm)],[64,220,theory(equality)])).
% cnf(331,plain,(addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one),inference(rw,[status(thm)],[48,34,theory(equality)])).
% cnf(587,plain,(leq(multiplication(multiplication(X2,coantidomain(X2)),one),X1)),inference(spm,[status(thm)],[209,236,theory(equality)])).
% cnf(592,negated_conjecture,(antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(multiplication(X1,coantidomain(X1))))))))))))!=one),inference(spm,[status(thm)],[94,236,theory(equality)])).
% cnf(603,plain,(leq(multiplication(X2,coantidomain(X2)),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[587,40,theory(equality)]),30,theory(equality)])).
% cnf(611,negated_conjecture,(antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(multiplication(X1,multiplication(X2,coantidomain(multiplication(X1,X2))))))))))))))!=one),inference(spm,[status(thm)],[592,40,theory(equality)])).
% cnf(1303,plain,(leq(coantidomain(one),X1)),inference(spm,[status(thm)],[603,32,theory(equality)])).
% cnf(1308,plain,(addition(coantidomain(one),X1)=X1),inference(spm,[status(thm)],[68,1303,theory(equality)])).
% cnf(1311,plain,(antidomain(one)=coantidomain(one)),inference(spm,[status(thm)],[221,1308,theory(equality)])).
% cnf(1333,plain,(coantidomain(coantidomain(one))=one),inference(spm,[status(thm)],[331,1308,theory(equality)])).
% cnf(1371,plain,(multiplication(X1,coantidomain(one))=antidomain(one)),inference(rw,[status(thm)],[235,1311,theory(equality)])).
% cnf(1372,plain,(multiplication(X1,coantidomain(one))=coantidomain(one)),inference(rw,[status(thm)],[1371,1311,theory(equality)])).
% cnf(1577,plain,(addition(coantidomain(one),antidomain(coantidomain(one)))=one),inference(spm,[status(thm)],[189,1311,theory(equality)])).
% cnf(1591,plain,(antidomain(coantidomain(one))=one),inference(rw,[status(thm)],[1577,1308,theory(equality)])).
% cnf(1629,negated_conjecture,(antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(multiplication(X1,multiplication(coantidomain(one),coantidomain(coantidomain(one))))))))))))))!=one),inference(spm,[status(thm)],[611,1372,theory(equality)])).
% cnf(1657,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1629,1333,theory(equality)]),30,theory(equality)]),1372,theory(equality)]),1591,theory(equality)]),1311,theory(equality)]),1591,theory(equality)]),1311,theory(equality)]),1372,theory(equality)]),1591,theory(equality)]),1311,theory(equality)]),1591,theory(equality)]),1311,theory(equality)]),1591,theory(equality)])).
% cnf(1658,negated_conjecture,($false),inference(cn,[status(thm)],[1657,theory(equality)])).
% cnf(1659,negated_conjecture,($false),1658,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 257
% # ...of these trivial : 28
% # ...subsumed : 135
% # ...remaining for further processing: 94
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 31
% # Generated clauses : 930
% # ...of the previous two non-trivial : 634
% # Contextual simplify-reflections : 0
% # Paramodulations : 924
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 38
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 5
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 300
% # ...number of literals in the above : 461
% # Clause-clause subsumption calls (NU) : 244
% # Rec. Clause-clause subsumption calls : 244
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 12
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 33
% # Backwards rewriting index: 85 leaves, 1.80+/-2.930 terms/leaf
% # Paramod-from index: 38 leaves, 1.13+/-0.409 terms/leaf
% # Paramod-into index: 73 leaves, 1.88+/-3.123 terms/leaf
% # -------------------------------------------------
% # User time : 0.034 s
% # System time : 0.004 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP9896/KLE114+1.tptp
%
%------------------------------------------------------------------------------