TSTP Solution File: ALG210+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG210+2 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 : Tue Dec 28 21:04:53 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/SystemOnTPTP4675/ALG210+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4675/ALG210+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4675/ALG210+2.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 4771
% 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]:(element(X1)<=>?[X2]:(times(X1,X2)=X1×(X1,X1)=X2)),file('/tmp/SRASS.s.p', axiom_2)).
% fof(2, axiom,![X3]:![X1]:![X2]:times(times(X3,X1),X2)=times(X1,times(X2,X3)),file('/tmp/SRASS.s.p', axiom_1)).
% fof(3, conjecture,![X3]:![X1]:![X2]:(((element(X3)&element(X1))&X2=times(X3,X1))=>element(X2)),file('/tmp/SRASS.s.p', conjecture_1)).
% fof(4, negated_conjecture,~(![X3]:![X1]:![X2]:(((element(X3)&element(X1))&X2=times(X3,X1))=>element(X2))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:((~(element(X1))|?[X2]:(times(X1,X2)=X1×(X1,X1)=X2))&(![X2]:(~(times(X1,X2)=X1)|~(times(X1,X1)=X2))|element(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(6, plain,![X3]:((~(element(X3))|?[X4]:(times(X3,X4)=X3×(X3,X3)=X4))&(![X5]:(~(times(X3,X5)=X3)|~(times(X3,X3)=X5))|element(X3))),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,![X3]:((~(element(X3))|(times(X3,esk1_1(X3))=X3×(X3,X3)=esk1_1(X3)))&(![X5]:(~(times(X3,X5)=X3)|~(times(X3,X3)=X5))|element(X3))),inference(skolemize,[status(esa)],[6])).
% fof(8, plain,![X3]:![X5]:(((~(times(X3,X5)=X3)|~(times(X3,X3)=X5))|element(X3))&(~(element(X3))|(times(X3,esk1_1(X3))=X3×(X3,X3)=esk1_1(X3)))),inference(shift_quantors,[status(thm)],[7])).
% fof(9, plain,![X3]:![X5]:(((~(times(X3,X5)=X3)|~(times(X3,X3)=X5))|element(X3))&((times(X3,esk1_1(X3))=X3|~(element(X3)))&(times(X3,X3)=esk1_1(X3)|~(element(X3))))),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,(times(X1,X1)=esk1_1(X1)|~element(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(times(X1,esk1_1(X1))=X1|~element(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(12,plain,(element(X1)|times(X1,X1)!=X2|times(X1,X2)!=X1),inference(split_conjunct,[status(thm)],[9])).
% fof(13, plain,![X4]:![X5]:![X6]:times(times(X4,X5),X6)=times(X5,times(X6,X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(14,plain,(times(times(X1,X2),X3)=times(X2,times(X3,X1))),inference(split_conjunct,[status(thm)],[13])).
% fof(15, negated_conjecture,?[X3]:?[X1]:?[X2]:(((element(X3)&element(X1))&X2=times(X3,X1))&~(element(X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(16, negated_conjecture,?[X4]:?[X5]:?[X6]:(((element(X4)&element(X5))&X6=times(X4,X5))&~(element(X6))),inference(variable_rename,[status(thm)],[15])).
% fof(17, negated_conjecture,(((element(esk2_0)&element(esk3_0))&esk4_0=times(esk2_0,esk3_0))&~(element(esk4_0))),inference(skolemize,[status(esa)],[16])).
% cnf(18,negated_conjecture,(~element(esk4_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,negated_conjecture,(esk4_0=times(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(20,negated_conjecture,(element(esk3_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(21,negated_conjecture,(element(esk2_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(22,negated_conjecture,(times(esk3_0,esk1_1(esk3_0))=esk3_0),inference(spm,[status(thm)],[11,20,theory(equality)])).
% cnf(23,negated_conjecture,(times(esk2_0,esk1_1(esk2_0))=esk2_0),inference(spm,[status(thm)],[11,21,theory(equality)])).
% cnf(24,negated_conjecture,(times(esk3_0,esk3_0)=esk1_1(esk3_0)),inference(spm,[status(thm)],[10,20,theory(equality)])).
% cnf(25,negated_conjecture,(times(esk2_0,esk2_0)=esk1_1(esk2_0)),inference(spm,[status(thm)],[10,21,theory(equality)])).
% cnf(27,negated_conjecture,(times(esk4_0,X1)=times(esk3_0,times(X1,esk2_0))),inference(spm,[status(thm)],[14,19,theory(equality)])).
% cnf(30,plain,(element(times(X1,X2))|times(X2,times(X3,X1))!=times(X1,X2)|times(times(X1,X2),times(X1,X2))!=X3),inference(spm,[status(thm)],[12,14,theory(equality)])).
% cnf(32,plain,(element(times(X1,X2))|times(X2,times(X3,X1))!=times(X1,X2)|times(X2,times(X2,times(X1,X1)))!=X3),inference(rw,[status(thm)],[inference(rw,[status(thm)],[30,14,theory(equality)]),14,theory(equality)])).
% cnf(33,negated_conjecture,(times(esk3_0,times(esk3_0,esk3_0))=esk3_0),inference(rw,[status(thm)],[22,24,theory(equality)])).
% cnf(35,negated_conjecture,(times(esk3_0,X1)=times(times(esk3_0,esk3_0),times(X1,esk3_0))),inference(spm,[status(thm)],[14,33,theory(equality)])).
% cnf(37,negated_conjecture,(times(esk3_0,X1)=times(esk3_0,times(esk3_0,times(esk3_0,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[35,14,theory(equality)]),14,theory(equality)])).
% cnf(38,negated_conjecture,(times(esk2_0,times(esk2_0,esk2_0))=esk2_0),inference(rw,[status(thm)],[23,25,theory(equality)])).
% cnf(40,negated_conjecture,(times(esk2_0,X1)=times(times(esk2_0,esk2_0),times(X1,esk2_0))),inference(spm,[status(thm)],[14,38,theory(equality)])).
% cnf(42,negated_conjecture,(times(esk2_0,X1)=times(esk2_0,times(esk2_0,times(esk2_0,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[40,14,theory(equality)]),14,theory(equality)])).
% cnf(74,negated_conjecture,(times(times(esk4_0,X1),X2)=times(times(X1,esk2_0),times(X2,esk3_0))),inference(spm,[status(thm)],[14,27,theory(equality)])).
% cnf(75,negated_conjecture,(element(times(esk2_0,esk3_0))|times(esk3_0,times(X1,esk2_0))!=times(esk2_0,esk3_0)|times(esk3_0,times(esk4_0,esk2_0))!=X1),inference(spm,[status(thm)],[32,27,theory(equality)])).
% cnf(78,negated_conjecture,(times(X1,times(X2,esk4_0))=times(times(X1,esk2_0),times(X2,esk3_0))),inference(rw,[status(thm)],[74,14,theory(equality)])).
% cnf(79,negated_conjecture,(times(X1,times(X2,esk4_0))=times(esk2_0,times(esk3_0,times(X1,X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[78,14,theory(equality)]),14,theory(equality)])).
% cnf(80,negated_conjecture,(element(esk4_0)|times(esk3_0,times(X1,esk2_0))!=times(esk2_0,esk3_0)|times(esk3_0,times(esk4_0,esk2_0))!=X1),inference(rw,[status(thm)],[75,19,theory(equality)])).
% cnf(81,negated_conjecture,(element(esk4_0)|times(esk4_0,X1)!=times(esk2_0,esk3_0)|times(esk3_0,times(esk4_0,esk2_0))!=X1),inference(rw,[status(thm)],[80,27,theory(equality)])).
% cnf(82,negated_conjecture,(element(esk4_0)|times(esk4_0,X1)!=esk4_0|times(esk3_0,times(esk4_0,esk2_0))!=X1),inference(rw,[status(thm)],[81,19,theory(equality)])).
% cnf(83,negated_conjecture,(element(esk4_0)|times(esk4_0,X1)!=esk4_0|times(esk4_0,esk4_0)!=X1),inference(rw,[status(thm)],[82,27,theory(equality)])).
% cnf(84,negated_conjecture,(times(esk4_0,X1)!=esk4_0|times(esk4_0,esk4_0)!=X1),inference(sr,[status(thm)],[83,18,theory(equality)])).
% cnf(90,negated_conjecture,(times(esk3_0,times(esk3_0,times(esk4_0,X1)))=times(esk4_0,X1)),inference(spm,[status(thm)],[37,27,theory(equality)])).
% cnf(91,negated_conjecture,(times(esk3_0,times(esk4_0,esk3_0))=times(esk3_0,esk2_0)),inference(spm,[status(thm)],[37,27,theory(equality)])).
% cnf(99,negated_conjecture,(times(times(esk3_0,esk2_0),X1)=times(times(esk4_0,esk3_0),times(X1,esk3_0))),inference(spm,[status(thm)],[14,91,theory(equality)])).
% cnf(102,negated_conjecture,(times(esk2_0,times(X1,esk3_0))=times(times(esk4_0,esk3_0),times(X1,esk3_0))),inference(rw,[status(thm)],[99,14,theory(equality)])).
% cnf(103,negated_conjecture,(times(esk2_0,times(X1,esk3_0))=times(esk3_0,times(esk3_0,times(esk4_0,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[102,14,theory(equality)]),14,theory(equality)])).
% cnf(109,negated_conjecture,(times(esk2_0,times(esk2_0,esk4_0))=esk4_0),inference(spm,[status(thm)],[42,19,theory(equality)])).
% cnf(123,negated_conjecture,(times(esk4_0,times(esk4_0,esk4_0))!=esk4_0),inference(er,[status(thm)],[84,theory(equality)])).
% cnf(130,negated_conjecture,(times(esk3_0,times(esk4_0,esk4_0))=times(esk4_0,esk2_0)),inference(spm,[status(thm)],[90,27,theory(equality)])).
% cnf(286,negated_conjecture,(times(esk4_0,X1)=times(esk2_0,times(X1,esk3_0))),inference(rw,[status(thm)],[103,90,theory(equality)])).
% cnf(298,negated_conjecture,(times(esk2_0,esk4_0)=times(esk4_0,esk2_0)),inference(spm,[status(thm)],[286,19,theory(equality)])).
% cnf(318,negated_conjecture,(times(esk3_0,times(esk4_0,esk4_0))=times(esk2_0,esk4_0)),inference(rw,[status(thm)],[130,298,theory(equality)])).
% cnf(719,negated_conjecture,(times(esk2_0,times(esk2_0,esk4_0))=times(esk4_0,times(esk4_0,esk4_0))),inference(spm,[status(thm)],[79,318,theory(equality)])).
% cnf(735,negated_conjecture,(esk4_0=times(esk4_0,times(esk4_0,esk4_0))),inference(rw,[status(thm)],[719,109,theory(equality)])).
% cnf(736,negated_conjecture,($false),inference(sr,[status(thm)],[735,123,theory(equality)])).
% cnf(737,negated_conjecture,($false),736,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 73
% # ...of these trivial : 4
% # ...subsumed : 16
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 324
% # ...of the previous two non-trivial : 257
% # Contextual simplify-reflections : 0
% # Paramodulations : 319
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 46
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 186
% # ...number of literals in the above : 276
% # Clause-clause subsumption calls (NU) : 63
% # Rec. Clause-clause subsumption calls : 61
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 66 leaves, 1.32+/-1.257 terms/leaf
% # Paramod-from index: 25 leaves, 1.08+/-0.271 terms/leaf
% # Paramod-into index: 53 leaves, 1.28+/-1.105 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP4675/ALG210+2.tptp
%
%------------------------------------------------------------------------------