TSTP Solution File: SWV121+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV121+1 : TPTP v5.0.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Thu Dec 30 08:32:36 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP12255/SWV121+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12255/SWV121+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12255/SWV121+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 12351
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(94, conjecture,(((![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,minus(n6,n1)))&leq(X10,minus(n6,n1)))=>a_select3(q_ds1_filter,X4,X10)=a_select3(q_ds1_filter,X10,X4))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,minus(n3,n1)))&leq(X23,minus(n3,n1)))=>a_select3(r_ds1_filter,X17,X23)=a_select3(r_ds1_filter,X23,X17)))&![X24]:![X25]:((((leq(n0,X24)&leq(n0,X25))&leq(X24,minus(n6,n1)))&leq(X25,minus(n6,n1)))=>a_select3(pminus_ds1_filter,X24,X25)=a_select3(pminus_ds1_filter,X25,X24)))=>true),file('/tmp/SRASS.s.p', quaternion_ds1_symm_0014)).
% fof(95, negated_conjecture,~((((![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,minus(n6,n1)))&leq(X10,minus(n6,n1)))=>a_select3(q_ds1_filter,X4,X10)=a_select3(q_ds1_filter,X10,X4))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,minus(n3,n1)))&leq(X23,minus(n3,n1)))=>a_select3(r_ds1_filter,X17,X23)=a_select3(r_ds1_filter,X23,X17)))&![X24]:![X25]:((((leq(n0,X24)&leq(n0,X25))&leq(X24,minus(n6,n1)))&leq(X25,minus(n6,n1)))=>a_select3(pminus_ds1_filter,X24,X25)=a_select3(pminus_ds1_filter,X25,X24)))=>true)),inference(assume_negation,[status(cth)],[94])).
% fof(98, plain,(epred2_0=>((![X4]:![X10]:((((leq(n0,X4)&leq(n0,X10))&leq(X4,minus(n6,n1)))&leq(X10,minus(n6,n1)))=>a_select3(q_ds1_filter,X4,X10)=a_select3(q_ds1_filter,X10,X4))&![X17]:![X23]:((((leq(n0,X17)&leq(n0,X23))&leq(X17,minus(n3,n1)))&leq(X23,minus(n3,n1)))=>a_select3(r_ds1_filter,X17,X23)=a_select3(r_ds1_filter,X23,X17)))&![X24]:![X25]:((((leq(n0,X24)&leq(n0,X25))&leq(X24,minus(n6,n1)))&leq(X25,minus(n6,n1)))=>a_select3(pminus_ds1_filter,X24,X25)=a_select3(pminus_ds1_filter,X25,X24)))),introduced(definition)).
% fof(100, negated_conjecture,~((epred2_0=>true)),inference(apply_def,[status(esa)],[95,98,theory(equality)])).
% cnf(109,plain,(true),inference(split_conjunct,[status(thm)],[4])).
% fof(396, negated_conjecture,(epred2_0&~(true)),inference(fof_nnf,[status(thm)],[100])).
% cnf(397,negated_conjecture,(~true),inference(split_conjunct,[status(thm)],[396])).
% cnf(464,negated_conjecture,($false),inference(rw,[status(thm)],[397,109,theory(equality)])).
% cnf(465,negated_conjecture,($false),inference(cn,[status(thm)],[464,theory(equality)])).
% cnf(466,negated_conjecture,($false),465,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 3
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 201
% # ...number of literals in the above : 835
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 2 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.002 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP12255/SWV121+1.tptp
%
%------------------------------------------------------------------------------