TSTP Solution File: NUM847+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM847+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 20:47:27 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP20012/NUM847+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20012/NUM847+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20012/NUM847+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 20109
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439)),file('/tmp/SRASS.s.p', 'holds(285, 440, 0)')).
% fof(12, axiom,![X18]:![X19]:vplus(X19,X18)=vplus(X18,X19),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(13, axiom,![X20]:![X21]:![X22]:vplus(vplus(X20,X21),X22)=vplus(X20,vplus(X21,X22)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(56, conjecture,vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),file('/tmp/SRASS.s.p', 'holds(286, 441, 3)')).
% fof(57, negated_conjecture,~(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(assume_negation,[status(cth)],[56])).
% fof(61, negated_conjecture,~(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(fof_simplification,[status(thm)],[57,theory(equality)])).
% cnf(63,plain,(vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439))),inference(split_conjunct,[status(thm)],[2])).
% fof(93, plain,![X20]:![X21]:vplus(X21,X20)=vplus(X20,X21),inference(variable_rename,[status(thm)],[12])).
% cnf(94,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, plain,![X23]:![X24]:![X25]:vplus(vplus(X23,X24),X25)=vplus(X23,vplus(X24,X25)),inference(variable_rename,[status(thm)],[13])).
% cnf(96,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[95])).
% cnf(217,negated_conjecture,(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)!=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(split_conjunct,[status(thm)],[61])).
% cnf(284,plain,(vplus(X1,vplus(X2,X3))=vplus(X2,vplus(X3,X1))),inference(spm,[status(thm)],[94,96,theory(equality)])).
% cnf(555,negated_conjecture,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))!=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[217,63,theory(equality)]),94,theory(equality)])).
% cnf(556,negated_conjecture,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))!=vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))),inference(rw,[status(thm)],[555,94,theory(equality)])).
% cnf(1492,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[556,284,theory(equality)]),94,theory(equality)]),63,theory(equality)])).
% cnf(1493,negated_conjecture,($false),inference(cn,[status(thm)],[1492,theory(equality)])).
% cnf(1494,negated_conjecture,($false),1493,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 246
% # ...of these trivial : 9
% # ...subsumed : 138
% # ...remaining for further processing: 99
% # Other redundant clauses eliminated : 43
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 1131
% # ...of the previous two non-trivial : 847
% # Contextual simplify-reflections : 0
% # Paramodulations : 1078
% # Factorizations : 0
% # Equation resolutions : 53
% # Current number of processed clauses: 91
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 29
% # Non-unit-clauses : 45
% # Current number of unprocessed clauses: 661
% # ...number of literals in the above : 1484
% # Clause-clause subsumption calls (NU) : 126
% # Rec. Clause-clause subsumption calls : 118
% # Unit Clause-clause subsumption calls : 142
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 49
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 53 leaves, 1.74+/-1.803 terms/leaf
% # Paramod-from index: 28 leaves, 1.32+/-0.467 terms/leaf
% # Paramod-into index: 48 leaves, 1.54+/-1.154 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP20012/NUM847+1.tptp
%
%------------------------------------------------------------------------------