TSTP Solution File: SWV229+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV229+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:46:26 EST 2010
% Result : Theorem 1.34s
% Output : Solution 1.34s
% 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/SystemOnTPTP6601/SWV229+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6601/SWV229+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6601/SWV229+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 6697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.034 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(85, conjecture,((![X4]:![X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n5))&leq(X14,n5))=>a_select3(q_ds1_filter,X4,X14)=a_select3(q_ds1_filter,X14,X4))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n2))&leq(X24,n2))=>a_select3(r_ds1_filter,X17,X24)=a_select3(r_ds1_filter,X24,X17)))=>![X25]:![X26]:((((leq(n0,X25)&leq(n0,X26))&leq(X25,n5))&leq(X26,n5))=>(((((((((((((((((((((((((((((((((~((n0=X25&n5=X26))&~((n0=X26&n2=X25)))&~((n0=X26&n3=X25)))&~((n0=X26&n4=X25)))&~((n0=X26&n5=X25)))&~((n1=X25&n2=X26)))&~((n1=X25&n3=X26)))&~((n1=X25&n4=X26)))&~((n1=X25&n5=X26)))&~((n1=X26&n2=X25)))&~((n1=X26&n3=X25)))&~((n1=X26&n4=X25)))&~((n1=X26&n5=X25)))&~((n2=X25&n2=X26)))&~((n2=X25&n3=X26)))&~((n2=X25&n4=X26)))&~((n2=X25&n5=X26)))&~((n2=X26&n3=X25)))&~((n2=X26&n4=X25)))&~((n2=X26&n5=X25)))&~((n3=X25&n3=X26)))&~((n3=X25&n4=X26)))&~((n3=X25&n5=X26)))&~((n3=X26&n4=X25)))&~((n3=X26&n5=X25)))&~((n4=X25&n4=X26)))&~((n4=X25&n5=X26)))&~((n4=X26&n5=X25)))&~((n5=X25&n5=X26)))&n1=X25)&n1=X26)&n4=X26)&n5=X25)=>a_select2(xinit_noise,n1)=n0))),file('/tmp/SRASS.s.p', quaternion_ds1_symm_0721)).
% fof(86, negated_conjecture,~(((![X4]:![X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n5))&leq(X14,n5))=>a_select3(q_ds1_filter,X4,X14)=a_select3(q_ds1_filter,X14,X4))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n2))&leq(X24,n2))=>a_select3(r_ds1_filter,X17,X24)=a_select3(r_ds1_filter,X24,X17)))=>![X25]:![X26]:((((leq(n0,X25)&leq(n0,X26))&leq(X25,n5))&leq(X26,n5))=>(((((((((((((((((((((((((((((((((~((n0=X25&n5=X26))&~((n0=X26&n2=X25)))&~((n0=X26&n3=X25)))&~((n0=X26&n4=X25)))&~((n0=X26&n5=X25)))&~((n1=X25&n2=X26)))&~((n1=X25&n3=X26)))&~((n1=X25&n4=X26)))&~((n1=X25&n5=X26)))&~((n1=X26&n2=X25)))&~((n1=X26&n3=X25)))&~((n1=X26&n4=X25)))&~((n1=X26&n5=X25)))&~((n2=X25&n2=X26)))&~((n2=X25&n3=X26)))&~((n2=X25&n4=X26)))&~((n2=X25&n5=X26)))&~((n2=X26&n3=X25)))&~((n2=X26&n4=X25)))&~((n2=X26&n5=X25)))&~((n3=X25&n3=X26)))&~((n3=X25&n4=X26)))&~((n3=X25&n5=X26)))&~((n3=X26&n4=X25)))&~((n3=X26&n5=X25)))&~((n4=X25&n4=X26)))&~((n4=X25&n5=X26)))&~((n4=X26&n5=X25)))&~((n5=X25&n5=X26)))&n1=X25)&n1=X26)&n4=X26)&n5=X25)=>a_select2(xinit_noise,n1)=n0)))),inference(assume_negation,[status(cth)],[85])).
% fof(89, plain,(epred2_0=>(![X4]:![X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n5))&leq(X14,n5))=>a_select3(q_ds1_filter,X4,X14)=a_select3(q_ds1_filter,X14,X4))&![X17]:![X24]:((((leq(n0,X17)&leq(n0,X24))&leq(X17,n2))&leq(X24,n2))=>a_select3(r_ds1_filter,X17,X24)=a_select3(r_ds1_filter,X24,X17)))),introduced(definition)).
% fof(90, plain,![X26]:![X25]:(epred3_2(X25,X26)=>((((((((((((((((((((((((((((((((~((n0=X25&n5=X26))&~((n0=X26&n2=X25)))&~((n0=X26&n3=X25)))&~((n0=X26&n4=X25)))&~((n0=X26&n5=X25)))&~((n1=X25&n2=X26)))&~((n1=X25&n3=X26)))&~((n1=X25&n4=X26)))&~((n1=X25&n5=X26)))&~((n1=X26&n2=X25)))&~((n1=X26&n3=X25)))&~((n1=X26&n4=X25)))&~((n1=X26&n5=X25)))&~((n2=X25&n2=X26)))&~((n2=X25&n3=X26)))&~((n2=X25&n4=X26)))&~((n2=X25&n5=X26)))&~((n2=X26&n3=X25)))&~((n2=X26&n4=X25)))&~((n2=X26&n5=X25)))&~((n3=X25&n3=X26)))&~((n3=X25&n4=X26)))&~((n3=X25&n5=X26)))&~((n3=X26&n4=X25)))&~((n3=X26&n5=X25)))&~((n4=X25&n4=X26)))&~((n4=X25&n5=X26)))&~((n4=X26&n5=X25)))&~((n5=X25&n5=X26)))&n1=X25)&n1=X26)&n4=X26)&n5=X25)),introduced(definition)).
% fof(92, negated_conjecture,~((epred2_0=>![X25]:![X26]:((((leq(n0,X25)&leq(n0,X26))&leq(X25,n5))&leq(X26,n5))=>(epred3_2(X25,X26)=>a_select2(xinit_noise,n1)=n0)))),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[86,89,theory(equality)]),90,theory(equality)])).
% fof(377, negated_conjecture,(epred2_0&?[X25]:?[X26]:((((leq(n0,X25)&leq(n0,X26))&leq(X25,n5))&leq(X26,n5))&(epred3_2(X25,X26)&~(a_select2(xinit_noise,n1)=n0)))),inference(fof_nnf,[status(thm)],[92])).
% fof(378, negated_conjecture,(epred2_0&?[X27]:?[X28]:((((leq(n0,X27)&leq(n0,X28))&leq(X27,n5))&leq(X28,n5))&(epred3_2(X27,X28)&~(a_select2(xinit_noise,n1)=n0)))),inference(variable_rename,[status(thm)],[377])).
% fof(379, negated_conjecture,(epred2_0&((((leq(n0,esk24_0)&leq(n0,esk25_0))&leq(esk24_0,n5))&leq(esk25_0,n5))&(epred3_2(esk24_0,esk25_0)&~(a_select2(xinit_noise,n1)=n0)))),inference(skolemize,[status(esa)],[378])).
% cnf(381,negated_conjecture,(epred3_2(esk24_0,esk25_0)),inference(split_conjunct,[status(thm)],[379])).
% fof(422, plain,![X26]:![X25]:(~(epred3_2(X25,X26))|(((((((((((((((((((((((((((((((((~(n0=X25)|~(n5=X26))&(~(n0=X26)|~(n2=X25)))&(~(n0=X26)|~(n3=X25)))&(~(n0=X26)|~(n4=X25)))&(~(n0=X26)|~(n5=X25)))&(~(n1=X25)|~(n2=X26)))&(~(n1=X25)|~(n3=X26)))&(~(n1=X25)|~(n4=X26)))&(~(n1=X25)|~(n5=X26)))&(~(n1=X26)|~(n2=X25)))&(~(n1=X26)|~(n3=X25)))&(~(n1=X26)|~(n4=X25)))&(~(n1=X26)|~(n5=X25)))&(~(n2=X25)|~(n2=X26)))&(~(n2=X25)|~(n3=X26)))&(~(n2=X25)|~(n4=X26)))&(~(n2=X25)|~(n5=X26)))&(~(n2=X26)|~(n3=X25)))&(~(n2=X26)|~(n4=X25)))&(~(n2=X26)|~(n5=X25)))&(~(n3=X25)|~(n3=X26)))&(~(n3=X25)|~(n4=X26)))&(~(n3=X25)|~(n5=X26)))&(~(n3=X26)|~(n4=X25)))&(~(n3=X26)|~(n5=X25)))&(~(n4=X25)|~(n4=X26)))&(~(n4=X25)|~(n5=X26)))&(~(n4=X26)|~(n5=X25)))&(~(n5=X25)|~(n5=X26)))&n1=X25)&n1=X26)&n4=X26)&n5=X25)),inference(fof_nnf,[status(thm)],[90])).
% fof(423, plain,![X27]:![X28]:(~(epred3_2(X28,X27))|(((((((((((((((((((((((((((((((((~(n0=X28)|~(n5=X27))&(~(n0=X27)|~(n2=X28)))&(~(n0=X27)|~(n3=X28)))&(~(n0=X27)|~(n4=X28)))&(~(n0=X27)|~(n5=X28)))&(~(n1=X28)|~(n2=X27)))&(~(n1=X28)|~(n3=X27)))&(~(n1=X28)|~(n4=X27)))&(~(n1=X28)|~(n5=X27)))&(~(n1=X27)|~(n2=X28)))&(~(n1=X27)|~(n3=X28)))&(~(n1=X27)|~(n4=X28)))&(~(n1=X27)|~(n5=X28)))&(~(n2=X28)|~(n2=X27)))&(~(n2=X28)|~(n3=X27)))&(~(n2=X28)|~(n4=X27)))&(~(n2=X28)|~(n5=X27)))&(~(n2=X27)|~(n3=X28)))&(~(n2=X27)|~(n4=X28)))&(~(n2=X27)|~(n5=X28)))&(~(n3=X28)|~(n3=X27)))&(~(n3=X28)|~(n4=X27)))&(~(n3=X28)|~(n5=X27)))&(~(n3=X27)|~(n4=X28)))&(~(n3=X27)|~(n5=X28)))&(~(n4=X28)|~(n4=X27)))&(~(n4=X28)|~(n5=X27)))&(~(n4=X27)|~(n5=X28)))&(~(n5=X28)|~(n5=X27)))&n1=X28)&n1=X27)&n4=X27)&n5=X28)),inference(variable_rename,[status(thm)],[422])).
% fof(424, plain,![X27]:![X28]:((((((((((((((((((((((((((((((((((~(n0=X28)|~(n5=X27))|~(epred3_2(X28,X27)))&((~(n0=X27)|~(n2=X28))|~(epred3_2(X28,X27))))&((~(n0=X27)|~(n3=X28))|~(epred3_2(X28,X27))))&((~(n0=X27)|~(n4=X28))|~(epred3_2(X28,X27))))&((~(n0=X27)|~(n5=X28))|~(epred3_2(X28,X27))))&((~(n1=X28)|~(n2=X27))|~(epred3_2(X28,X27))))&((~(n1=X28)|~(n3=X27))|~(epred3_2(X28,X27))))&((~(n1=X28)|~(n4=X27))|~(epred3_2(X28,X27))))&((~(n1=X28)|~(n5=X27))|~(epred3_2(X28,X27))))&((~(n1=X27)|~(n2=X28))|~(epred3_2(X28,X27))))&((~(n1=X27)|~(n3=X28))|~(epred3_2(X28,X27))))&((~(n1=X27)|~(n4=X28))|~(epred3_2(X28,X27))))&((~(n1=X27)|~(n5=X28))|~(epred3_2(X28,X27))))&((~(n2=X28)|~(n2=X27))|~(epred3_2(X28,X27))))&((~(n2=X28)|~(n3=X27))|~(epred3_2(X28,X27))))&((~(n2=X28)|~(n4=X27))|~(epred3_2(X28,X27))))&((~(n2=X28)|~(n5=X27))|~(epred3_2(X28,X27))))&((~(n2=X27)|~(n3=X28))|~(epred3_2(X28,X27))))&((~(n2=X27)|~(n4=X28))|~(epred3_2(X28,X27))))&((~(n2=X27)|~(n5=X28))|~(epred3_2(X28,X27))))&((~(n3=X28)|~(n3=X27))|~(epred3_2(X28,X27))))&((~(n3=X28)|~(n4=X27))|~(epred3_2(X28,X27))))&((~(n3=X28)|~(n5=X27))|~(epred3_2(X28,X27))))&((~(n3=X27)|~(n4=X28))|~(epred3_2(X28,X27))))&((~(n3=X27)|~(n5=X28))|~(epred3_2(X28,X27))))&((~(n4=X28)|~(n4=X27))|~(epred3_2(X28,X27))))&((~(n4=X28)|~(n5=X27))|~(epred3_2(X28,X27))))&((~(n4=X27)|~(n5=X28))|~(epred3_2(X28,X27))))&((~(n5=X28)|~(n5=X27))|~(epred3_2(X28,X27))))&(n1=X28|~(epred3_2(X28,X27))))&(n1=X27|~(epred3_2(X28,X27))))&(n4=X27|~(epred3_2(X28,X27))))&(n5=X28|~(epred3_2(X28,X27)))),inference(distribute,[status(thm)],[423])).
% cnf(425,plain,(n5=X1|~epred3_2(X1,X2)),inference(split_conjunct,[status(thm)],[424])).
% cnf(427,plain,(n1=X2|~epred3_2(X1,X2)),inference(split_conjunct,[status(thm)],[424])).
% cnf(445,plain,(~epred3_2(X1,X2)|n5!=X1|n1!=X2),inference(split_conjunct,[status(thm)],[424])).
% cnf(489,plain,(n1!=X2|~epred3_2(X1,X2)),inference(csr,[status(thm)],[445,425])).
% cnf(490,plain,(~epred3_2(X1,X2)),inference(csr,[status(thm)],[489,427])).
% cnf(491,negated_conjecture,($false),inference(sr,[status(thm)],[381,490,theory(equality)])).
% cnf(492,negated_conjecture,($false),491,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 47
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 1
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 3
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 186
% # ...number of literals in the above : 856
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 52 leaves, 1.06+/-0.233 terms/leaf
% # Paramod-from index: 34 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 50 leaves, 1.04+/-0.196 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.009 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.21 WC
% FINAL PrfWatch: 0.16 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP6601/SWV229+1.tptp
%
%------------------------------------------------------------------------------