TSTP Solution File: GRP710+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP710+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:20:54 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP1796/GRP710+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1796/GRP710+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1796/GRP710+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 1896
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:mult(X1,unit)=X1,file('/tmp/SRASS.s.p', f01)).
% fof(2, axiom,![X1]:mult(unit,X1)=X1,file('/tmp/SRASS.s.p', f02)).
% fof(3, axiom,![X2]:![X3]:![X1]:mult(X1,mult(X3,mult(X3,X2)))=mult(mult(mult(X1,X3),X3),X2),file('/tmp/SRASS.s.p', f03)).
% fof(5, axiom,![X1]:mult(i(X1),X1)=unit,file('/tmp/SRASS.s.p', f05)).
% fof(6, conjecture,(![X4]:![X5]:?[X6]:mult(X4,X6)=X5&![X7]:![X8]:?[X9]:mult(X9,X8)=X7),file('/tmp/SRASS.s.p', goals)).
% fof(7, negated_conjecture,~((![X4]:![X5]:?[X6]:mult(X4,X6)=X5&![X7]:![X8]:?[X9]:mult(X9,X8)=X7)),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X2]:mult(X2,unit)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(9,plain,(mult(X1,unit)=X1),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X2]:mult(unit,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(11,plain,(mult(unit,X1)=X1),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:![X6]:mult(X6,mult(X5,mult(X5,X4)))=mult(mult(mult(X6,X5),X5),X4),inference(variable_rename,[status(thm)],[3])).
% cnf(13,plain,(mult(X1,mult(X2,mult(X2,X3)))=mult(mult(mult(X1,X2),X2),X3)),inference(split_conjunct,[status(thm)],[12])).
% fof(16, plain,![X2]:mult(i(X2),X2)=unit,inference(variable_rename,[status(thm)],[5])).
% cnf(17,plain,(mult(i(X1),X1)=unit),inference(split_conjunct,[status(thm)],[16])).
% fof(18, negated_conjecture,(?[X4]:?[X5]:![X6]:~(mult(X4,X6)=X5)|?[X7]:?[X8]:![X9]:~(mult(X9,X8)=X7)),inference(fof_nnf,[status(thm)],[7])).
% fof(19, negated_conjecture,(?[X10]:?[X11]:![X12]:~(mult(X10,X12)=X11)|?[X13]:?[X14]:![X15]:~(mult(X15,X14)=X13)),inference(variable_rename,[status(thm)],[18])).
% fof(20, negated_conjecture,(![X12]:~(mult(esk1_0,X12)=esk2_0)|![X15]:~(mult(X15,esk4_0)=esk3_0)),inference(skolemize,[status(esa)],[19])).
% fof(21, negated_conjecture,![X12]:![X15]:(~(mult(X15,esk4_0)=esk3_0)|~(mult(esk1_0,X12)=esk2_0)),inference(shift_quantors,[status(thm)],[20])).
% cnf(22,negated_conjecture,(mult(esk1_0,X1)!=esk2_0|mult(X2,esk4_0)!=esk3_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(34,plain,(mult(X1,mult(X2,mult(X2,unit)))=mult(mult(X1,X2),X2)),inference(spm,[status(thm)],[9,13,theory(equality)])).
% cnf(42,plain,(mult(X1,mult(X2,X2))=mult(mult(X1,X2),X2)),inference(rw,[status(thm)],[34,9,theory(equality)])).
% cnf(53,negated_conjecture,(mult(X1,mult(esk4_0,esk4_0))!=esk3_0|mult(esk1_0,X2)!=esk2_0),inference(spm,[status(thm)],[22,42,theory(equality)])).
% cnf(56,plain,(mult(unit,X1)=mult(i(X1),mult(X1,X1))),inference(spm,[status(thm)],[42,17,theory(equality)])).
% cnf(60,plain,(mult(mult(X1,mult(X2,X2)),X3)=mult(X1,mult(X2,mult(X2,X3)))),inference(rw,[status(thm)],[13,42,theory(equality)])).
% cnf(63,plain,(X1=mult(i(X1),mult(X1,X1))),inference(rw,[status(thm)],[56,11,theory(equality)])).
% cnf(89,plain,(mult(mult(X1,mult(X2,mult(X2,X3))),X3)=mult(mult(X1,mult(X2,X2)),mult(X3,X3))),inference(spm,[status(thm)],[42,60,theory(equality)])).
% cnf(95,plain,(mult(unit,X2)=mult(i(mult(X1,X1)),mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,17,theory(equality)])).
% cnf(96,plain,(mult(X1,X2)=mult(i(X1),mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,63,theory(equality)])).
% cnf(98,plain,(mult(mult(X1,X1),X2)=mult(unit,mult(X1,mult(X1,X2)))),inference(spm,[status(thm)],[60,11,theory(equality)])).
% cnf(102,plain,(mult(mult(X1,mult(X2,mult(X2,X3))),X3)=mult(X1,mult(X2,mult(X2,mult(X3,X3))))),inference(rw,[status(thm)],[89,60,theory(equality)])).
% cnf(108,plain,(X2=mult(i(mult(X1,X1)),mult(X1,mult(X1,X2)))),inference(rw,[status(thm)],[95,11,theory(equality)])).
% cnf(111,plain,(mult(mult(X1,X1),X2)=mult(X1,mult(X1,X2))),inference(rw,[status(thm)],[98,11,theory(equality)])).
% cnf(162,plain,(mult(i(i(X1)),mult(i(X1),X1))=X1),inference(spm,[status(thm)],[96,63,theory(equality)])).
% cnf(177,plain,(i(i(X1))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[162,17,theory(equality)]),9,theory(equality)])).
% cnf(295,plain,(mult(i(i(mult(X1,X1))),mult(i(mult(X1,X1)),X2))=X2),inference(spm,[status(thm)],[96,108,theory(equality)])).
% cnf(316,plain,(mult(X1,mult(X1,mult(i(mult(X1,X1)),X2)))=X2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[295,177,theory(equality)]),111,theory(equality)])).
% cnf(457,plain,(mult(i(X1),mult(X1,X2))=X2),inference(spm,[status(thm)],[96,316,theory(equality)])).
% cnf(523,plain,(mult(X1,mult(i(X1),X2))=X2),inference(spm,[status(thm)],[457,177,theory(equality)])).
% cnf(542,negated_conjecture,(mult(X1,mult(esk4_0,esk4_0))!=esk3_0|X2!=esk2_0),inference(spm,[status(thm)],[53,523,theory(equality)])).
% cnf(733,negated_conjecture,(mult(X1,mult(esk4_0,esk4_0))!=esk3_0),inference(er,[status(thm)],[542,theory(equality)])).
% cnf(2482,plain,(mult(mult(X1,mult(i(X2),unit)),X2)=mult(X1,mult(i(X2),mult(i(X2),mult(X2,X2))))),inference(spm,[status(thm)],[102,17,theory(equality)])).
% cnf(2554,plain,(mult(mult(X1,i(X2)),X2)=mult(X1,mult(i(X2),mult(i(X2),mult(X2,X2))))),inference(rw,[status(thm)],[2482,9,theory(equality)])).
% cnf(2555,plain,(mult(mult(X1,i(X2)),X2)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2554,457,theory(equality)]),17,theory(equality)]),9,theory(equality)])).
% cnf(2615,negated_conjecture,(X1!=esk3_0),inference(spm,[status(thm)],[733,2555,theory(equality)])).
% cnf(3232,negated_conjecture,($false),inference(er,[status(thm)],[2615,theory(equality)])).
% cnf(3233,negated_conjecture,($false),3232,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 129
% # ...of these trivial : 12
% # ...subsumed : 32
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 19
% # Generated clauses : 1571
% # ...of the previous two non-trivial : 1000
% # Contextual simplify-reflections : 0
% # Paramodulations : 1567
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 54
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 519
% # ...number of literals in the above : 529
% # Clause-clause subsumption calls (NU) : 94
% # Rec. Clause-clause subsumption calls : 94
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 81
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 45 leaves, 2.07+/-1.993 terms/leaf
% # Paramod-from index: 24 leaves, 1.29+/-0.841 terms/leaf
% # Paramod-into index: 45 leaves, 1.69+/-1.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.045 s
% # System time : 0.006 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP1796/GRP710+1.tptp
%
%------------------------------------------------------------------------------