TSTP Solution File: KLE005+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE005+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 : art02.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:30:06 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP6119/KLE005+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6119/KLE005+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6119/KLE005+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 6215
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(~(test(X1))=>c(X1)=zero),file('/tmp/SRASS.s.p', test_4)).
% fof(2, axiom,![X2]:multiplication(X2,one)=X2,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(11, axiom,![X1]:![X5]:(complement(X5,X1)<=>((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(12, axiom,![X1]:![X5]:(test(X1)=>(c(X1)=X5<=>complement(X1,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(17, conjecture,c(one)=zero,file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(c(one)=zero),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X1]:(~(test(X1))=>c(X1)=zero),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(20, negated_conjecture,~(c(one)=zero),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(21, plain,![X1]:(test(X1)|c(X1)=zero),inference(fof_nnf,[status(thm)],[19])).
% fof(22, plain,![X2]:(test(X2)|c(X2)=zero),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(c(X1)=zero|test(X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:multiplication(X3,one)=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(42, plain,![X1]:![X5]:((~(complement(X5,X1))|((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one))&(((~(multiplication(X1,X5)=zero)|~(multiplication(X5,X1)=zero))|~(addition(X1,X5)=one))|complement(X5,X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% cnf(48,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[44])).
% fof(49, plain,![X1]:![X5]:(~(test(X1))|((~(c(X1)=X5)|complement(X1,X5))&(~(complement(X1,X5))|c(X1)=X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(50, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[50])).
% cnf(53,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[51])).
% cnf(68,negated_conjecture,(c(one)!=zero),inference(split_conjunct,[status(thm)],[20])).
% cnf(69,negated_conjecture,(test(one)),inference(spm,[status(thm)],[68,23,theory(equality)])).
% cnf(80,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[53,theory(equality)])).
% cnf(224,negated_conjecture,(complement(one,c(one))),inference(spm,[status(thm)],[80,69,theory(equality)])).
% cnf(226,negated_conjecture,(multiplication(c(one),one)=zero),inference(spm,[status(thm)],[48,224,theory(equality)])).
% cnf(230,negated_conjecture,(c(one)=zero),inference(rw,[status(thm)],[226,25,theory(equality)])).
% cnf(231,negated_conjecture,($false),inference(sr,[status(thm)],[230,68,theory(equality)])).
% cnf(232,negated_conjecture,($false),231,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 35
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 88
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 0
% # Paramodulations : 86
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 46
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 34 leaves, 1.32+/-0.962 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-into index: 24 leaves, 1.33+/-0.745 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP6119/KLE005+1.tptp
%
%------------------------------------------------------------------------------