TSTP Solution File: NUM846+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM846+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:47:12 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP16601/NUM846+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16601/NUM846+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16601/NUM846+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 16697
% 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(1, axiom,vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439)),file('/tmp/SRASS.s.p', 'holds(285, 440, 0)')).
% fof(11, axiom,![X18]:![X19]:vplus(X19,X18)=vplus(X18,X19),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(55, conjecture,vplus(vmul(vd436,vplus(vd437,vd439)),vd436)=vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436),file('/tmp/SRASS.s.p', 'holds(286, 441, 2)')).
% fof(56, negated_conjecture,~(vplus(vmul(vd436,vplus(vd437,vd439)),vd436)=vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)),inference(assume_negation,[status(cth)],[55])).
% fof(60, negated_conjecture,~(vplus(vmul(vd436,vplus(vd437,vd439)),vd436)=vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)),inference(fof_simplification,[status(thm)],[56,theory(equality)])).
% cnf(61,plain,(vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439))),inference(split_conjunct,[status(thm)],[1])).
% fof(91, plain,![X20]:![X21]:vplus(X21,X20)=vplus(X20,X21),inference(variable_rename,[status(thm)],[11])).
% cnf(92,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[91])).
% cnf(215,negated_conjecture,(vplus(vmul(vd436,vplus(vd437,vd439)),vd436)!=vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)),inference(split_conjunct,[status(thm)],[60])).
% cnf(282,negated_conjecture,(vplus(vd436,vplus(vmul(vd436,vd437),vmul(vd436,vd439)))!=vplus(vmul(vd436,vplus(vd437,vd439)),vd436)),inference(rw,[status(thm)],[215,92,theory(equality)])).
% cnf(283,negated_conjecture,(vplus(vd436,vplus(vmul(vd436,vd437),vmul(vd436,vd439)))!=vplus(vd436,vmul(vd436,vplus(vd437,vd439)))),inference(rw,[status(thm)],[282,92,theory(equality)])).
% cnf(1039,negated_conjecture,($false),inference(rw,[status(thm)],[283,61,theory(equality)])).
% cnf(1040,negated_conjecture,($false),inference(cn,[status(thm)],[1039,theory(equality)])).
% cnf(1041,negated_conjecture,($false),1040,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 260
% # ...of these trivial : 6
% # ...subsumed : 130
% # ...remaining for further processing: 124
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 3
% # Generated clauses : 704
% # ...of the previous two non-trivial : 652
% # Contextual simplify-reflections : 2
% # Paramodulations : 661
% # Factorizations : 2
% # Equation resolutions : 41
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 34
% # Non-unit-clauses : 61
% # Current number of unprocessed clauses: 429
% # ...number of literals in the above : 882
% # Clause-clause subsumption calls (NU) : 263
% # Rec. Clause-clause subsumption calls : 259
% # Unit Clause-clause subsumption calls : 133
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 47
% # Indexed BW rewrite successes : 27
% # Backwards rewriting index: 67 leaves, 1.67+/-1.418 terms/leaf
% # Paramod-from index: 23 leaves, 1.22+/-0.412 terms/leaf
% # Paramod-into index: 58 leaves, 1.69+/-1.417 terms/leaf
% # -------------------------------------------------
% # User time : 0.033 s
% # System time : 0.006 s
% # Total time : 0.039 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP16601/NUM846+1.tptp
%
%------------------------------------------------------------------------------