TSTP Solution File: SWV023+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV023+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:10:04 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP26918/SWV023+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26918/SWV023+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26918/SWV023+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 27014
% 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(3, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(85, conjecture,((((i0_init=init&sigma_init=init)&![X4]:((leq(n0,X4)&leq(X4,n2))=>![X14]:((leq(n0,X14)&leq(X14,n3))=>a_select3(simplex7_init,X14,X4)=init)))&![X17]:((leq(n0,X17)&leq(X17,n3))=>a_select2(s_values7_init,X17)=init))=>true),file('/tmp/SRASS.s.p', gauss_init_0005)).
% fof(86, negated_conjecture,~(((((i0_init=init&sigma_init=init)&![X4]:((leq(n0,X4)&leq(X4,n2))=>![X14]:((leq(n0,X14)&leq(X14,n3))=>a_select3(simplex7_init,X14,X4)=init)))&![X17]:((leq(n0,X17)&leq(X17,n3))=>a_select2(s_values7_init,X17)=init))=>true)),inference(assume_negation,[status(cth)],[85])).
% cnf(95,plain,(true),inference(split_conjunct,[status(thm)],[3])).
% fof(374, negated_conjecture,((((i0_init=init&sigma_init=init)&![X4]:((~(leq(n0,X4))|~(leq(X4,n2)))|![X14]:((~(leq(n0,X14))|~(leq(X14,n3)))|a_select3(simplex7_init,X14,X4)=init)))&![X17]:((~(leq(n0,X17))|~(leq(X17,n3)))|a_select2(s_values7_init,X17)=init))&~(true)),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,((((i0_init=init&sigma_init=init)&![X18]:((~(leq(n0,X18))|~(leq(X18,n2)))|![X19]:((~(leq(n0,X19))|~(leq(X19,n3)))|a_select3(simplex7_init,X19,X18)=init)))&![X20]:((~(leq(n0,X20))|~(leq(X20,n3)))|a_select2(s_values7_init,X20)=init))&~(true)),inference(variable_rename,[status(thm)],[374])).
% fof(376, negated_conjecture,![X18]:![X19]:![X20]:((((~(leq(n0,X20))|~(leq(X20,n3)))|a_select2(s_values7_init,X20)=init)&((((~(leq(n0,X19))|~(leq(X19,n3)))|a_select3(simplex7_init,X19,X18)=init)|(~(leq(n0,X18))|~(leq(X18,n2))))&(i0_init=init&sigma_init=init)))&~(true)),inference(shift_quantors,[status(thm)],[375])).
% cnf(377,negated_conjecture,(~true),inference(split_conjunct,[status(thm)],[376])).
% cnf(439,negated_conjecture,($false),inference(rw,[status(thm)],[377,95,theory(equality)])).
% cnf(440,negated_conjecture,($false),inference(cn,[status(thm)],[439,theory(equality)])).
% cnf(441,negated_conjecture,($false),440,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 4
% # 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: 3
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 191
% # ...number of literals in the above : 808
% # 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: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.005 s
% # Total time : 0.032 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/SystemOnTPTP26918/SWV023+1.tptp
%
%------------------------------------------------------------------------------