TSTP Solution File: KLE021+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE021+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:34:27 EST 2010
% Result : Theorem 0.95s
% Output : Solution 0.95s
% 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/SystemOnTPTP14291/KLE021+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14291/KLE021+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14291/KLE021+3.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 14387
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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(6, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(10, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(13, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(18, 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(19, conjecture,![X4]:![X5]:(test(X5)=>X4=addition(multiplication(X5,X4),multiplication(c(X5),X4))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:(test(X5)=>X4=addition(multiplication(X5,X4),multiplication(c(X5),X4)))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(32, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(43, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[10])).
% fof(44, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[44])).
% cnf(47,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[45])).
% fof(56, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(57,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(68, 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)],[18])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% cnf(72,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(75, negated_conjecture,?[X4]:?[X5]:(test(X5)&~(X4=addition(multiplication(X5,X4),multiplication(c(X5),X4)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X6]:?[X7]:(test(X7)&~(X6=addition(multiplication(X7,X6),multiplication(c(X7),X6)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,(test(esk3_0)&~(esk2_0=addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(esk2_0!=addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(92,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[47,theory(equality)])).
% cnf(191,negated_conjecture,(multiplication(addition(esk3_0,c(esk3_0)),esk2_0)!=esk2_0),inference(rw,[status(thm)],[78,33,theory(equality)])).
% cnf(247,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[72,92,theory(equality)])).
% cnf(2529,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[247,23,theory(equality)])).
% cnf(2533,negated_conjecture,(multiplication(one,esk2_0)!=esk2_0|~test(esk3_0)),inference(spm,[status(thm)],[191,2529,theory(equality)])).
% cnf(2585,negated_conjecture,($false|~test(esk3_0)),inference(rw,[status(thm)],[2533,57,theory(equality)])).
% cnf(2586,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2585,79,theory(equality)])).
% cnf(2587,negated_conjecture,($false),inference(cn,[status(thm)],[2586,theory(equality)])).
% cnf(2588,negated_conjecture,($false),2587,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 244
% # ...of these trivial : 42
% # ...subsumed : 83
% # ...remaining for further processing: 119
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 7
% # Generated clauses : 1369
% # ...of the previous two non-trivial : 743
% # Contextual simplify-reflections : 0
% # Paramodulations : 1361
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 111
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 488
% # ...number of literals in the above : 990
% # Clause-clause subsumption calls (NU) : 278
% # Rec. Clause-clause subsumption calls : 272
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 62
% # Indexed BW rewrite successes : 39
% # Backwards rewriting index: 113 leaves, 1.34+/-0.983 terms/leaf
% # Paramod-from index: 64 leaves, 1.19+/-0.527 terms/leaf
% # Paramod-into index: 88 leaves, 1.33+/-0.985 terms/leaf
% # -------------------------------------------------
% # User time : 0.041 s
% # System time : 0.005 s
% # Total time : 0.046 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP14291/KLE021+3.tptp
%
%------------------------------------------------------------------------------