TSTP Solution File: SWV128+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV128+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 : art01.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:34:31 EST 2010
% Result : Theorem 1.36s
% Output : Solution 1.36s
% 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/SystemOnTPTP3457/SWV128+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3457/SWV128+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3457/SWV128+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 3553
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 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(92, conjecture,(((((((t_defuse=use&tvar_defuse=use)&![X8]:![X12]:((((leq(n0,X8)&leq(n0,X12))&leq(X8,minus(m_measvars,n1)))&leq(X12,minus(n_steps,n1)))=>a_select3(rho_defuse,X8,X12)=use))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n7))&leq(X24,minus(n_steps,n1)))=>a_select3(tr_defuse,X17,X24)=use))&![X25]:((leq(n0,X25)&leq(X25,minus(n_statevars,n1)))=>a_select2(xinit_defuse,X25)=use))&![X26]:((leq(n0,X26)&leq(X26,minus(n_statevars,n1)))=>a_select2(xinit_mean_defuse,X26)=use))&![X28]:![X29]:((((leq(n0,X28)&leq(n0,X29))&leq(X28,minus(m_measvars,n1)))&leq(X29,minus(n_steps,n1)))=>a_select3(z_defuse,X28,X29)=use))=>true),file('/tmp/SRASS.s.p', thruster_inuse_0001)).
% fof(93, negated_conjecture,~((((((((t_defuse=use&tvar_defuse=use)&![X8]:![X12]:((((leq(n0,X8)&leq(n0,X12))&leq(X8,minus(m_measvars,n1)))&leq(X12,minus(n_steps,n1)))=>a_select3(rho_defuse,X8,X12)=use))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n7))&leq(X24,minus(n_steps,n1)))=>a_select3(tr_defuse,X17,X24)=use))&![X25]:((leq(n0,X25)&leq(X25,minus(n_statevars,n1)))=>a_select2(xinit_defuse,X25)=use))&![X26]:((leq(n0,X26)&leq(X26,minus(n_statevars,n1)))=>a_select2(xinit_mean_defuse,X26)=use))&![X28]:![X29]:((((leq(n0,X28)&leq(n0,X29))&leq(X28,minus(m_measvars,n1)))&leq(X29,minus(n_steps,n1)))=>a_select3(z_defuse,X28,X29)=use))=>true)),inference(assume_negation,[status(cth)],[92])).
% fof(96, plain,(epred2_0=>((((((t_defuse=use&tvar_defuse=use)&![X8]:![X12]:((((leq(n0,X8)&leq(n0,X12))&leq(X8,minus(m_measvars,n1)))&leq(X12,minus(n_steps,n1)))=>a_select3(rho_defuse,X8,X12)=use))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n7))&leq(X24,minus(n_steps,n1)))=>a_select3(tr_defuse,X17,X24)=use))&![X25]:((leq(n0,X25)&leq(X25,minus(n_statevars,n1)))=>a_select2(xinit_defuse,X25)=use))&![X26]:((leq(n0,X26)&leq(X26,minus(n_statevars,n1)))=>a_select2(xinit_mean_defuse,X26)=use))&![X28]:![X29]:((((leq(n0,X28)&leq(n0,X29))&leq(X28,minus(m_measvars,n1)))&leq(X29,minus(n_steps,n1)))=>a_select3(z_defuse,X28,X29)=use))),introduced(definition)).
% fof(98, negated_conjecture,~((epred2_0=>true)),inference(apply_def,[status(esa)],[93,96,theory(equality)])).
% cnf(107,plain,(true),inference(split_conjunct,[status(thm)],[4])).
% fof(390, negated_conjecture,(epred2_0&~(true)),inference(fof_nnf,[status(thm)],[98])).
% cnf(391,negated_conjecture,(~true),inference(split_conjunct,[status(thm)],[390])).
% cnf(461,negated_conjecture,($false),inference(rw,[status(thm)],[391,107,theory(equality)])).
% cnf(462,negated_conjecture,($false),inference(cn,[status(thm)],[461,theory(equality)])).
% cnf(463,negated_conjecture,($false),462,['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: 203
% # ...number of literals in the above : 837
% # 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.17 CPU 0.21 WC
% FINAL PrfWatch: 0.17 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP3457/SWV128+1.tptp
%
%------------------------------------------------------------------------------