TSTP Solution File: NUM851+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM851+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 : 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 20:48:21 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP17119/NUM851+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17119/NUM851+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17119/NUM851+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 17215
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 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(15, axiom,vd470=vplus(vd471,vd473),file('/tmp/SRASS.s.p', 'holds(conseq_conjunct1(conseq(302)), 474, 0)')).
% fof(54, 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(55, negated_conjecture,~(vmul(vplus(vd471,vd473),vd469)=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(assume_negation,[status(cth)],[54])).
% fof(59, negated_conjecture,~(vmul(vplus(vd471,vd473),vd469)=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(fof_simplification,[status(thm)],[55,theory(equality)])).
% fof(62, plain,![X7]:![X8]:![X9]:vmul(X7,vplus(X8,X9))=vplus(vmul(X7,X8),vmul(X7,X9)),inference(variable_rename,[status(thm)],[2])).
% cnf(63,plain,(vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X9]:![X10]:vmul(X9,X10)=vmul(X10,X9),inference(variable_rename,[status(thm)],[3])).
% cnf(65,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[64])).
% cnf(98,plain,(vd470=vplus(vd471,vd473)),inference(split_conjunct,[status(thm)],[15])).
% cnf(215,negated_conjecture,(vmul(vplus(vd471,vd473),vd469)!=vplus(vmul(vd471,vd469),vmul(vd473,vd469))),inference(split_conjunct,[status(thm)],[59])).
% cnf(236,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd473,vd469))!=vmul(vd470,vd469)),inference(rw,[status(thm)],[215,98,theory(equality)])).
% cnf(409,plain,(vplus(vmul(X2,X1),vmul(X1,X3))=vmul(X1,vplus(X2,X3))),inference(spm,[status(thm)],[63,65,theory(equality)])).
% cnf(710,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd469,vd473))!=vmul(vd470,vd469)),inference(rw,[status(thm)],[236,65,theory(equality)])).
% cnf(711,negated_conjecture,(vplus(vmul(vd471,vd469),vmul(vd469,vd473))!=vmul(vd469,vd470)),inference(rw,[status(thm)],[710,65,theory(equality)])).
% cnf(7980,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[711,409,theory(equality)]),98,theory(equality)])).
% cnf(7981,negated_conjecture,($false),inference(cn,[status(thm)],[7980,theory(equality)])).
% cnf(7982,negated_conjecture,($false),7981,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1846
% # ...of these trivial : 65
% # ...subsumed : 1260
% # ...remaining for further processing: 521
% # Other redundant clauses eliminated : 39
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 20
% # Generated clauses : 6328
% # ...of the previous two non-trivial : 5753
% # Contextual simplify-reflections : 0
% # Paramodulations : 6229
% # Factorizations : 2
% # Equation resolutions : 97
% # Current number of processed clauses: 493
% # Positive orientable unit clauses: 90
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 154
% # Non-unit-clauses : 240
% # Current number of unprocessed clauses: 3840
% # ...number of literals in the above : 7148
% # Clause-clause subsumption calls (NU) : 4843
% # Rec. Clause-clause subsumption calls : 4838
% # Unit Clause-clause subsumption calls : 603
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 118
% # Indexed BW rewrite successes : 77
% # Backwards rewriting index: 292 leaves, 1.39+/-1.240 terms/leaf
% # Paramod-from index: 102 leaves, 1.12+/-0.403 terms/leaf
% # Paramod-into index: 254 leaves, 1.41+/-1.263 terms/leaf
% # -------------------------------------------------
% # User time : 0.195 s
% # System time : 0.012 s
% # Total time : 0.207 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.45 WC
% FINAL PrfWatch: 0.37 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP17119/NUM851+1.tptp
%
%------------------------------------------------------------------------------