TSTP Solution File: KLE065+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE065+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:52:12 EST 2010
% Result : Theorem 5.87s
% Output : Solution 5.87s
% 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/SystemOnTPTP16164/KLE065+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16164/KLE065+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16164/KLE065+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 16260
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.01 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(5, axiom,domain(zero)=zero,file('/tmp/SRASS.s.p', domain4)).
% fof(6, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(10, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(11, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(15, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(18, conjecture,![X4]:![X5]:(multiplication(X4,X5)=zero=>multiplication(X4,domain(X5))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:(multiplication(X4,X5)=zero=>multiplication(X4,domain(X5))=zero)),inference(assume_negation,[status(cth)],[18])).
% fof(24, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(domain(zero)=zero),inference(split_conjunct,[status(thm)],[5])).
% fof(29, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(37, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(47, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[49])).
% fof(55, negated_conjecture,?[X4]:?[X5]:(multiplication(X4,X5)=zero&~(multiplication(X4,domain(X5))=zero)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:?[X7]:(multiplication(X6,X7)=zero&~(multiplication(X6,domain(X7))=zero)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(multiplication(esk1_0,esk2_0)=zero&~(multiplication(esk1_0,domain(esk2_0))=zero)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(multiplication(esk1_0,domain(esk2_0))!=zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero),inference(split_conjunct,[status(thm)],[57])).
% cnf(70,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[50,40,theory(equality)])).
% cnf(184,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[38,48,theory(equality)])).
% cnf(1383,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[184,40,theory(equality)])).
% cnf(1422,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[30,1383,theory(equality)]),40,theory(equality)]),70,theory(equality)]),48,theory(equality)])).
% cnf(1621,plain,(multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2)))=multiplication(X1,domain(X2))),inference(spm,[status(thm)],[1422,27,theory(equality)])).
% cnf(184681,negated_conjecture,(multiplication(domain(zero),multiplication(esk1_0,domain(esk2_0)))=multiplication(esk1_0,domain(esk2_0))),inference(spm,[status(thm)],[1621,59,theory(equality)])).
% cnf(185021,negated_conjecture,(zero=multiplication(esk1_0,domain(esk2_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[184681,28,theory(equality)]),25,theory(equality)])).
% cnf(185022,negated_conjecture,($false),inference(sr,[status(thm)],[185021,58,theory(equality)])).
% cnf(185023,negated_conjecture,($false),185022,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4654
% # ...of these trivial : 1463
% # ...subsumed : 2473
% # ...remaining for further processing: 718
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 115
% # Generated clauses : 101074
% # ...of the previous two non-trivial : 60209
% # Contextual simplify-reflections : 0
% # Paramodulations : 101073
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 603
% # Positive orientable unit clauses: 482
% # Positive unorientable unit clauses: 10
% # Negative unit clauses : 1
% # Non-unit-clauses : 110
% # Current number of unprocessed clauses: 48168
% # ...number of literals in the above : 60570
% # Clause-clause subsumption calls (NU) : 14825
% # Rec. Clause-clause subsumption calls : 14825
% # Unit Clause-clause subsumption calls : 294
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2031
% # Indexed BW rewrite successes : 321
% # Backwards rewriting index: 511 leaves, 2.20+/-2.201 terms/leaf
% # Paramod-from index: 230 leaves, 2.17+/-1.806 terms/leaf
% # Paramod-into index: 423 leaves, 2.25+/-2.248 terms/leaf
% # -------------------------------------------------
% # User time : 2.479 s
% # System time : 0.104 s
% # Total time : 2.583 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.06 CPU 5.19 WC
% FINAL PrfWatch: 5.06 CPU 5.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP16164/KLE065+1.tptp
%
%------------------------------------------------------------------------------