TSTP Solution File: SWV189+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV189+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:41:56 EST 2010
% Result : Theorem 1.56s
% Output : Solution 1.56s
% 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/SystemOnTPTP16950/SWV189+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16950/SWV189+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16950/SWV189+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 17046
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 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(7, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(27, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(52, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(70, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(85, conjecture,(![X4]:((leq(n0,X4)&leq(X4,n4))=>a_select3(center_init,X4,n0)=init)=>![X14]:((leq(n0,X14)&leq(X14,tptp_minus_1))=>![X18]:((leq(n0,X18)&leq(X18,n4))=>a_select3(q_init,X14,X18)=init))),file('/tmp/SRASS.s.p', cl5_nebula_init_0121)).
% fof(86, negated_conjecture,~((![X4]:((leq(n0,X4)&leq(X4,n4))=>a_select3(center_init,X4,n0)=init)=>![X14]:((leq(n0,X14)&leq(X14,tptp_minus_1))=>![X18]:((leq(n0,X18)&leq(X18,n4))=>a_select3(q_init,X14,X18)=init)))),inference(assume_negation,[status(cth)],[85])).
% fof(87, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[27,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(119,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[7])).
% fof(249, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(250,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[249])).
% fof(316, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[52])).
% fof(317, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[316])).
% cnf(319,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[317])).
% fof(347, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[70])).
% cnf(348,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[347])).
% fof(374, negated_conjecture,(![X4]:((~(leq(n0,X4))|~(leq(X4,n4)))|a_select3(center_init,X4,n0)=init)&?[X14]:((leq(n0,X14)&leq(X14,tptp_minus_1))&?[X18]:((leq(n0,X18)&leq(X18,n4))&~(a_select3(q_init,X14,X18)=init)))),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,(![X19]:((~(leq(n0,X19))|~(leq(X19,n4)))|a_select3(center_init,X19,n0)=init)&?[X20]:((leq(n0,X20)&leq(X20,tptp_minus_1))&?[X21]:((leq(n0,X21)&leq(X21,n4))&~(a_select3(q_init,X20,X21)=init)))),inference(variable_rename,[status(thm)],[374])).
% fof(376, negated_conjecture,(![X19]:((~(leq(n0,X19))|~(leq(X19,n4)))|a_select3(center_init,X19,n0)=init)&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&((leq(n0,esk25_0)&leq(esk25_0,n4))&~(a_select3(q_init,esk24_0,esk25_0)=init)))),inference(skolemize,[status(esa)],[375])).
% fof(377, negated_conjecture,![X19]:(((~(leq(n0,X19))|~(leq(X19,n4)))|a_select3(center_init,X19,n0)=init)&((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&((leq(n0,esk25_0)&leq(esk25_0,n4))&~(a_select3(q_init,esk24_0,esk25_0)=init)))),inference(shift_quantors,[status(thm)],[376])).
% cnf(381,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[377])).
% cnf(382,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[377])).
% cnf(418,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[119,348,theory(equality)]),['unfolding']).
% cnf(438,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[319,348,theory(equality)]),['unfolding']).
% cnf(493,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk24_0)),inference(spm,[status(thm)],[94,381,theory(equality)])).
% cnf(566,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[250,438,theory(equality)])).
% cnf(5633,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[566,418,theory(equality)])).
% cnf(8718,negated_conjecture,(leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[493,382,theory(equality)])).
% cnf(8722,negated_conjecture,($false),inference(sr,[status(thm)],[8718,5633,theory(equality)])).
% cnf(8723,negated_conjecture,($false),8722,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 456
% # ...of these trivial : 7
% # ...subsumed : 18
% # ...remaining for further processing: 431
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4976
% # ...of the previous two non-trivial : 4937
% # Contextual simplify-reflections : 0
% # Paramodulations : 4963
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 234
% # Positive orientable unit clauses: 66
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 15
% # Non-unit-clauses : 148
% # Current number of unprocessed clauses: 4873
% # ...number of literals in the above : 31078
% # Clause-clause subsumption calls (NU) : 3476
% # Rec. Clause-clause subsumption calls : 1282
% # Unit Clause-clause subsumption calls : 107
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 262 leaves, 1.24+/-1.446 terms/leaf
% # Paramod-from index: 97 leaves, 1.04+/-0.199 terms/leaf
% # Paramod-into index: 156 leaves, 1.13+/-0.551 terms/leaf
% # -------------------------------------------------
% # User time : 0.301 s
% # System time : 0.010 s
% # Total time : 0.311 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.54 CPU 0.63 WC
% FINAL PrfWatch: 0.54 CPU 0.63 WC
% SZS output end Solution for /tmp/SystemOnTPTP16950/SWV189+1.tptp
%
%------------------------------------------------------------------------------