TSTP Solution File: KLE119+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE119+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 08:07:23 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP30597/KLE119+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30597/KLE119+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30597/KLE119+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 30729
% 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]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:multiplication(X1,zero)=zero,file('/tmp/SRASS.s.p', right_annihilation)).
% fof(9, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(11, axiom,![X4]:![X5]:backward_diamond(X4,X5)=codomain(multiplication(codomain(X5),X4)),file('/tmp/SRASS.s.p', backward_diamond)).
% fof(16, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(17, axiom,![X4]:multiplication(X4,coantidomain(X4))=zero,file('/tmp/SRASS.s.p', codomain1)).
% fof(21, axiom,![X4]:codomain(X4)=coantidomain(coantidomain(X4)),file('/tmp/SRASS.s.p', codomain4)).
% fof(22, axiom,![X4]:addition(coantidomain(coantidomain(X4)),coantidomain(X4))=one,file('/tmp/SRASS.s.p', codomain3)).
% fof(23, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(24, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(25, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(27, conjecture,![X4]:![X5]:addition(backward_diamond(zero,domain(X4)),domain(X5))=domain(X5),file('/tmp/SRASS.s.p', goals)).
% fof(28, negated_conjecture,~(![X4]:![X5]:addition(backward_diamond(zero,domain(X4)),domain(X5))=domain(X5)),inference(assume_negation,[status(cth)],[27])).
% fof(29, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(30,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(34,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(37, plain,![X2]:multiplication(X2,zero)=zero,inference(variable_rename,[status(thm)],[5])).
% cnf(38,plain,(multiplication(X1,zero)=zero),inference(split_conjunct,[status(thm)],[37])).
% fof(45, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[9])).
% cnf(46,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X6]:![X7]:backward_diamond(X6,X7)=codomain(multiplication(codomain(X7),X6)),inference(variable_rename,[status(thm)],[11])).
% cnf(50,plain,(backward_diamond(X1,X2)=codomain(multiplication(codomain(X2),X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(61, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[16])).
% cnf(62,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X5]:multiplication(X5,coantidomain(X5))=zero,inference(variable_rename,[status(thm)],[17])).
% cnf(64,plain,(multiplication(X1,coantidomain(X1))=zero),inference(split_conjunct,[status(thm)],[63])).
% fof(71, plain,![X5]:codomain(X5)=coantidomain(coantidomain(X5)),inference(variable_rename,[status(thm)],[21])).
% cnf(72,plain,(codomain(X1)=coantidomain(coantidomain(X1))),inference(split_conjunct,[status(thm)],[71])).
% fof(73, plain,![X5]:addition(coantidomain(coantidomain(X5)),coantidomain(X5))=one,inference(variable_rename,[status(thm)],[22])).
% cnf(74,plain,(addition(coantidomain(coantidomain(X1)),coantidomain(X1))=one),inference(split_conjunct,[status(thm)],[73])).
% fof(75, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[23])).
% cnf(76,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[75])).
% fof(77, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[24])).
% cnf(78,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[77])).
% fof(79, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[25])).
% cnf(80,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[79])).
% fof(83, negated_conjecture,?[X4]:?[X5]:~(addition(backward_diamond(zero,domain(X4)),domain(X5))=domain(X5)),inference(fof_nnf,[status(thm)],[28])).
% fof(84, negated_conjecture,?[X6]:?[X7]:~(addition(backward_diamond(zero,domain(X6)),domain(X7))=domain(X7)),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,~(addition(backward_diamond(zero,domain(esk1_0)),domain(esk2_0))=domain(esk2_0)),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(addition(backward_diamond(zero,domain(esk1_0)),domain(esk2_0))!=domain(esk2_0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(93,negated_conjecture,(addition(backward_diamond(zero,antidomain(antidomain(esk1_0))),antidomain(antidomain(esk2_0)))!=antidomain(antidomain(esk2_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[86,46,theory(equality)]),46,theory(equality)]),46,theory(equality)]),['unfolding']).
% cnf(94,plain,(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(X2)),X1)))=backward_diamond(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,72,theory(equality)]),72,theory(equality)]),['unfolding']).
% cnf(96,negated_conjecture,(addition(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(esk1_0)))),zero))),antidomain(antidomain(esk2_0)))!=antidomain(antidomain(esk2_0))),inference(rw,[status(thm)],[93,94,theory(equality)]),['unfolding']).
% cnf(97,negated_conjecture,(addition(coantidomain(coantidomain(zero)),antidomain(antidomain(esk2_0)))!=antidomain(antidomain(esk2_0))),inference(rw,[status(thm)],[96,38,theory(equality)])).
% cnf(103,plain,(zero=coantidomain(one)),inference(spm,[status(thm)],[80,64,theory(equality)])).
% cnf(155,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[78,62,theory(equality)])).
% cnf(172,plain,(addition(antidomain(zero),zero)=one),inference(spm,[status(thm)],[76,155,theory(equality)])).
% cnf(174,plain,(antidomain(zero)=one),inference(rw,[status(thm)],[172,34,theory(equality)])).
% cnf(177,plain,(coantidomain(antidomain(zero))=zero),inference(rw,[status(thm)],[103,174,theory(equality)])).
% cnf(239,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[34,30,theory(equality)])).
% cnf(336,plain,(addition(coantidomain(X1),coantidomain(coantidomain(X1)))=one),inference(rw,[status(thm)],[74,30,theory(equality)])).
% cnf(337,plain,(addition(coantidomain(X1),coantidomain(coantidomain(X1)))=antidomain(zero)),inference(rw,[status(thm)],[336,174,theory(equality)])).
% cnf(355,plain,(addition(zero,coantidomain(zero))=antidomain(zero)),inference(spm,[status(thm)],[337,177,theory(equality)])).
% cnf(361,plain,(coantidomain(zero)=antidomain(zero)),inference(rw,[status(thm)],[355,239,theory(equality)])).
% cnf(370,plain,(coantidomain(coantidomain(zero))=zero),inference(rw,[status(thm)],[177,361,theory(equality)])).
% cnf(415,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[97,370,theory(equality)]),239,theory(equality)])).
% cnf(416,negated_conjecture,($false),inference(cn,[status(thm)],[415,theory(equality)])).
% cnf(417,negated_conjecture,($false),416,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 100
% # ...of these trivial : 2
% # ...subsumed : 53
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 15
% # Generated clauses : 207
% # ...of the previous two non-trivial : 180
% # Contextual simplify-reflections : 0
% # Paramodulations : 205
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 4
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 60
% # ...number of literals in the above : 84
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 71
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 8
% # Indexed BW rewrite attempts : 39
% # Indexed BW rewrite successes : 36
% # Backwards rewriting index: 32 leaves, 1.44+/-0.864 terms/leaf
% # Paramod-from index: 15 leaves, 1.13+/-0.499 terms/leaf
% # Paramod-into index: 27 leaves, 1.41+/-0.828 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.006 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP30597/KLE119+1.tptp
%
%------------------------------------------------------------------------------