TSTP Solution File: NUM851+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM851+2 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:53:12 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP26386/NUM851+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26386/NUM851+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26386/NUM851+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 26518
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X4]:![X5]:![X6]:vmul(X4,vplus(X5,X6))=vplus(vmul(X4,X5),vmul(X4,X6)),file('/tmp/SRASS.s.p', 'ass(cond(281, 0), 0)')).
% fof(3, axiom,![X7]:![X8]:vmul(X7,X8)=vmul(X8,X7),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(13, axiom,vd470=vplus(vd471,vd473),file('/tmp/SRASS.s.p', 'holds(conseq_conjunct1(conseq(302)), 474, 0)')).
% fof(27, conjecture,vmul(vplus(vd471,vd473),vd469)=vplus(vmul(vd471,vd469),vmul(vd473,vd469)),file('/tmp/SRASS.s.p', 'holds(conseq_conjunct2(conseq(302)), 475, 1)')).
% fof(28, negated_conjecture,~(vmul(vplus(vd471,vd473),vd469)=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(assume_negation,[status(cth)],[27])).
% fof(29, negated_conjecture,~(vmul(vplus(vd471,vd473),vd469)=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(32, plain,![X7]:![X8]:![X9]:vmul(X7,vplus(X8,X9))=vplus(vmul(X7,X8),vmul(X7,X9)),inference(variable_rename,[status(thm)],[2])).
% cnf(33,plain,(vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X9]:![X10]:vmul(X9,X10)=vmul(X10,X9),inference(variable_rename,[status(thm)],[3])).
% cnf(35,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(62,plain,(vd470=vplus(vd471,vd473)),inference(split_conjunct,[status(thm)],[13])).
% cnf(98,negated_conjecture,(vmul(vplus(vd471,vd473),vd469)!=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(split_conjunct,[status(thm)],[29])).
% cnf(112,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd473,vd469))!=vmul(vd470,vd469)),inference(rw,[status(thm)],[98,62,theory(equality)])).
% cnf(211,plain,(vplus(vmul(X2,X1),vmul(X1,X3))=vmul(X1,vplus(X2,X3))),inference(spm,[status(thm)],[33,35,theory(equality)])).
% cnf(395,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd469,vd473))!=vmul(vd470,vd469)),inference(rw,[status(thm)],[112,35,theory(equality)])).
% cnf(396,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd469,vd473))!=vmul(vd469,vd470)),inference(rw,[status(thm)],[395,35,theory(equality)])).
% cnf(3507,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[396,211,theory(equality)]),62,theory(equality)])).
% cnf(3508,negated_conjecture,($false),inference(cn,[status(thm)],[3507,theory(equality)])).
% cnf(3509,negated_conjecture,($false),3508,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 936
% # ...of these trivial : 13
% # ...subsumed : 710
% # ...remaining for further processing: 213
% # Other redundant clauses eliminated : 23
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 10
% # Generated clauses : 2792
% # ...of the previous two non-trivial : 2634
% # Contextual simplify-reflections : 0
% # Paramodulations : 2738
% # Factorizations : 0
% # Equation resolutions : 54
% # Current number of processed clauses: 198
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 73
% # Non-unit-clauses : 92
% # Current number of unprocessed clauses: 1701
% # ...number of literals in the above : 3035
% # Clause-clause subsumption calls (NU) : 2384
% # Rec. Clause-clause subsumption calls : 2382
% # Unit Clause-clause subsumption calls : 379
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 124
% # Indexed BW rewrite successes : 111
% # Backwards rewriting index: 106 leaves, 1.45+/-1.340 terms/leaf
% # Paramod-from index: 35 leaves, 1.26+/-0.602 terms/leaf
% # Paramod-into index: 89 leaves, 1.52+/-1.447 terms/leaf
% # -------------------------------------------------
% # User time : 0.088 s
% # System time : 0.002 s
% # Total time : 0.090 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP26386/NUM851+2.tptp
%
%------------------------------------------------------------------------------