TSTP Solution File: SWV191+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWV191+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 : art03.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:42:09 EST 2010

% Result   : Theorem 1.59s
% Output   : Solution 1.59s
% 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/SystemOnTPTP22746/SWV191+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22746/SWV191+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22746/SWV191+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 22843
% 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(2, axiom,![X1]:![X2]:![X3]:((leq(X1,X2)&leq(X2,X3))=>leq(X1,X3)),file('/tmp/SRASS.s.p', transitivity_leq)).
% fof(13, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(58, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(67, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(68, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(77, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(85, conjecture,(((((((((((((((((((((((((((a_select2(rho_defuse,n0)=use&a_select2(rho_defuse,n1)=use)&a_select2(rho_defuse,n2)=use)&a_select2(sigma_defuse,n0)=use)&a_select2(sigma_defuse,n1)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n4)=use)&a_select2(sigma_defuse,n5)=use)&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&a_select2(xinit_mean_defuse,n0)=use)&a_select2(xinit_mean_defuse,n1)=use)&a_select2(xinit_mean_defuse,n2)=use)&a_select2(xinit_mean_defuse,n3)=use)&a_select2(xinit_mean_defuse,n4)=use)&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&a_select2(xinit_noise_defuse,n1)=use)&a_select2(xinit_noise_defuse,n2)=use)&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n4)=use)&a_select2(xinit_noise_defuse,n5)=use)=>![X4]:![X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n2))&leq(X14,tptp_minus_1))=>a_select3(z_defuse,X4,X14)=use)),file('/tmp/SRASS.s.p', quaternion_ds1_inuse_0002)).
% fof(86, negated_conjecture,~((((((((((((((((((((((((((((a_select2(rho_defuse,n0)=use&a_select2(rho_defuse,n1)=use)&a_select2(rho_defuse,n2)=use)&a_select2(sigma_defuse,n0)=use)&a_select2(sigma_defuse,n1)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n4)=use)&a_select2(sigma_defuse,n5)=use)&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&a_select2(xinit_mean_defuse,n0)=use)&a_select2(xinit_mean_defuse,n1)=use)&a_select2(xinit_mean_defuse,n2)=use)&a_select2(xinit_mean_defuse,n3)=use)&a_select2(xinit_mean_defuse,n4)=use)&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&a_select2(xinit_noise_defuse,n1)=use)&a_select2(xinit_noise_defuse,n2)=use)&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n4)=use)&a_select2(xinit_noise_defuse,n5)=use)=>![X4]:![X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n2))&leq(X14,tptp_minus_1))=>a_select3(z_defuse,X4,X14)=use))),inference(assume_negation,[status(cth)],[85])).
% fof(87, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% fof(92, plain,![X1]:![X2]:![X3]:((~(leq(X1,X2))|~(leq(X2,X3)))|leq(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(93, plain,![X4]:![X5]:![X6]:((~(leq(X4,X5))|~(leq(X5,X6)))|leq(X4,X6)),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(leq(X1,X2)|~leq(X3,X2)|~leq(X1,X3)),inference(split_conjunct,[status(thm)],[93])).
% cnf(135,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[13])).
% fof(299, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(300,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[299])).
% fof(332, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[67])).
% cnf(333,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[332])).
% fof(334, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[68])).
% cnf(335,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[334])).
% fof(352, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[77])).
% fof(353, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[352])).
% cnf(355,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[353])).
% fof(374, negated_conjecture,(((((((((((((((((((((((((((a_select2(rho_defuse,n0)=use&a_select2(rho_defuse,n1)=use)&a_select2(rho_defuse,n2)=use)&a_select2(sigma_defuse,n0)=use)&a_select2(sigma_defuse,n1)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n4)=use)&a_select2(sigma_defuse,n5)=use)&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&a_select2(xinit_mean_defuse,n0)=use)&a_select2(xinit_mean_defuse,n1)=use)&a_select2(xinit_mean_defuse,n2)=use)&a_select2(xinit_mean_defuse,n3)=use)&a_select2(xinit_mean_defuse,n4)=use)&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&a_select2(xinit_noise_defuse,n1)=use)&a_select2(xinit_noise_defuse,n2)=use)&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n4)=use)&a_select2(xinit_noise_defuse,n5)=use)&?[X4]:?[X14]:((((leq(n0,X4)&leq(n0,X14))&leq(X4,n2))&leq(X14,tptp_minus_1))&~(a_select3(z_defuse,X4,X14)=use))),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,(((((((((((((((((((((((((((a_select2(rho_defuse,n0)=use&a_select2(rho_defuse,n1)=use)&a_select2(rho_defuse,n2)=use)&a_select2(sigma_defuse,n0)=use)&a_select2(sigma_defuse,n1)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n4)=use)&a_select2(sigma_defuse,n5)=use)&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&a_select2(xinit_mean_defuse,n0)=use)&a_select2(xinit_mean_defuse,n1)=use)&a_select2(xinit_mean_defuse,n2)=use)&a_select2(xinit_mean_defuse,n3)=use)&a_select2(xinit_mean_defuse,n4)=use)&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&a_select2(xinit_noise_defuse,n1)=use)&a_select2(xinit_noise_defuse,n2)=use)&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n4)=use)&a_select2(xinit_noise_defuse,n5)=use)&?[X15]:?[X16]:((((leq(n0,X15)&leq(n0,X16))&leq(X15,n2))&leq(X16,tptp_minus_1))&~(a_select3(z_defuse,X15,X16)=use))),inference(variable_rename,[status(thm)],[374])).
% fof(376, negated_conjecture,(((((((((((((((((((((((((((a_select2(rho_defuse,n0)=use&a_select2(rho_defuse,n1)=use)&a_select2(rho_defuse,n2)=use)&a_select2(sigma_defuse,n0)=use)&a_select2(sigma_defuse,n1)=use)&a_select2(sigma_defuse,n2)=use)&a_select2(sigma_defuse,n3)=use)&a_select2(sigma_defuse,n4)=use)&a_select2(sigma_defuse,n5)=use)&a_select3(u_defuse,n0,n0)=use)&a_select3(u_defuse,n1,n0)=use)&a_select3(u_defuse,n2,n0)=use)&a_select2(xinit_defuse,n3)=use)&a_select2(xinit_defuse,n4)=use)&a_select2(xinit_defuse,n5)=use)&a_select2(xinit_mean_defuse,n0)=use)&a_select2(xinit_mean_defuse,n1)=use)&a_select2(xinit_mean_defuse,n2)=use)&a_select2(xinit_mean_defuse,n3)=use)&a_select2(xinit_mean_defuse,n4)=use)&a_select2(xinit_mean_defuse,n5)=use)&a_select2(xinit_noise_defuse,n0)=use)&a_select2(xinit_noise_defuse,n1)=use)&a_select2(xinit_noise_defuse,n2)=use)&a_select2(xinit_noise_defuse,n3)=use)&a_select2(xinit_noise_defuse,n4)=use)&a_select2(xinit_noise_defuse,n5)=use)&((((leq(n0,esk24_0)&leq(n0,esk25_0))&leq(esk24_0,n2))&leq(esk25_0,tptp_minus_1))&~(a_select3(z_defuse,esk24_0,esk25_0)=use))),inference(skolemize,[status(esa)],[375])).
% cnf(378,negated_conjecture,(leq(esk25_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[376])).
% cnf(380,negated_conjecture,(leq(n0,esk25_0)),inference(split_conjunct,[status(thm)],[376])).
% cnf(443,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[135,333,theory(equality)]),['unfolding']).
% cnf(446,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[335,333,theory(equality)]),['unfolding']).
% cnf(463,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[355,333,theory(equality)]),['unfolding']).
% cnf(467,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[443,446,theory(equality)])).
% cnf(554,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk25_0)),inference(spm,[status(thm)],[94,378,theory(equality)])).
% cnf(589,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[300,463,theory(equality)])).
% cnf(6071,plain,(~leq(plus(n1,X1),X1)),inference(spm,[status(thm)],[589,446,theory(equality)])).
% cnf(7379,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[6071,467,theory(equality)])).
% cnf(9147,negated_conjecture,(leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[554,380,theory(equality)])).
% cnf(9151,negated_conjecture,($false),inference(sr,[status(thm)],[9147,7379,theory(equality)])).
% cnf(9152,negated_conjecture,($false),9151,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 529
% # ...of these trivial                : 7
% # ...subsumed                        : 21
% # ...remaining for further processing: 501
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 5352
% # ...of the previous two non-trivial : 5295
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 5337
% # Factorizations                     : 6
% # Equation resolutions               : 9
% # Current number of processed clauses: 277
% #    Positive orientable unit clauses: 97
% #    Positive unorientable unit clauses: 5
% #    Negative unit clauses           : 19
% #    Non-unit-clauses                : 156
% # Current number of unprocessed clauses: 5210
% # ...number of literals in the above : 33609
% # Clause-clause subsumption calls (NU) : 4836
% # Rec. Clause-clause subsumption calls : 1427
% # Unit Clause-clause subsumption calls : 108
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 31
% # Indexed BW rewrite successes       : 21
% # Backwards rewriting index:   303 leaves,   1.21+/-1.347 terms/leaf
% # Paramod-from index:          132 leaves,   1.02+/-0.149 terms/leaf
% # Paramod-into index:          199 leaves,   1.10+/-0.487 terms/leaf
% # -------------------------------------------------
% # User time              : 0.308 s
% # System time            : 0.016 s
% # Total time             : 0.324 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.58 CPU 0.67 WC
% FINAL PrfWatch: 0.58 CPU 0.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP22746/SWV191+1.tptp
% 
%------------------------------------------------------------------------------