TSTP Solution File: KLE074+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE074+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 : 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:52:59 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP23970/KLE074+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23970/KLE074+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23970/KLE074+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 24066
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(2, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(18, conjecture,![X4]:![X5]:![X6]:domain(multiplication(multiplication(X4,X5),domain(X6)))=domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:![X6]:domain(multiplication(multiplication(X4,X5),domain(X6)))=domain(multiplication(X4,domain(multiplication(X5,domain(X6)))))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[22])).
% fof(55, negated_conjecture,?[X4]:?[X5]:?[X6]:~(domain(multiplication(multiplication(X4,X5),domain(X6)))=domain(multiplication(X4,domain(multiplication(X5,domain(X6)))))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X7]:?[X8]:?[X9]:~(domain(multiplication(multiplication(X7,X8),domain(X9)))=domain(multiplication(X7,domain(multiplication(X8,domain(X9)))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0)))=domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0)))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0)))!=domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0)))))),inference(split_conjunct,[status(thm)],[57])).
% cnf(78,negated_conjecture,(domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0)))))!=domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0))))),inference(rw,[status(thm)],[58,21,theory(equality)])).
% cnf(118,plain,(domain(multiplication(X1,domain(multiplication(X2,X3))))=domain(multiplication(X1,multiplication(X2,domain(X3))))),inference(spm,[status(thm)],[23,23,theory(equality)])).
% cnf(124,plain,(domain(multiplication(X1,multiplication(X2,X3)))=domain(multiplication(X1,multiplication(X2,domain(X3))))),inference(rw,[status(thm)],[118,23,theory(equality)])).
% cnf(235,negated_conjecture,(domain(multiplication(esk1_0,multiplication(esk2_0,esk3_0)))!=domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[78,23,theory(equality)]),23,theory(equality)])).
% cnf(4916,negated_conjecture,($false),inference(rw,[status(thm)],[235,124,theory(equality)])).
% cnf(4917,negated_conjecture,($false),inference(cn,[status(thm)],[4916,theory(equality)])).
% cnf(4918,negated_conjecture,($false),4917,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 338
% # ...of these trivial : 76
% # ...subsumed : 156
% # ...remaining for further processing: 106
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 2661
% # ...of the previous two non-trivial : 1466
% # Contextual simplify-reflections : 0
% # Paramodulations : 2660
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 97
% # Positive orientable unit clauses: 76
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 1097
% # ...number of literals in the above : 1390
% # Clause-clause subsumption calls (NU) : 484
% # Rec. Clause-clause subsumption calls : 484
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 77
% # Indexed BW rewrite successes : 44
% # Backwards rewriting index: 94 leaves, 1.62+/-1.121 terms/leaf
% # Paramod-from index: 61 leaves, 1.33+/-0.671 terms/leaf
% # Paramod-into index: 79 leaves, 1.62+/-1.151 terms/leaf
% # -------------------------------------------------
% # User time : 0.058 s
% # System time : 0.008 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP23970/KLE074+1.tptp
%
%------------------------------------------------------------------------------