TSTP Solution File: SWV151+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV151+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 : art02.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:37:56 EST 2010
% Result : Theorem 1.53s
% Output : Solution 1.53s
% 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/SystemOnTPTP8601/SWV151+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8601/SWV151+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8601/SWV151+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 8697
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(11, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(36, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(55, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(56, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(63, axiom,![X1]:![X2]:(leq(X1,X2)<=>gt(succ(X2),X1)),file('/tmp/SRASS.s.p', leq_succ_gt_equiv)).
% fof(85, conjecture,![X5]:((leq(n0,X5)&leq(X5,tptp_minus_1))=>sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1),file('/tmp/SRASS.s.p', cl5_nebula_norm_0001)).
% fof(86, negated_conjecture,~(![X5]:((leq(n0,X5)&leq(X5,tptp_minus_1))=>sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1)),inference(assume_negation,[status(cth)],[85])).
% fof(87, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[36,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(129,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[11])).
% fof(267, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[87])).
% cnf(268,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[267])).
% fof(318, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[55])).
% cnf(319,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[318])).
% fof(320, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[56])).
% cnf(321,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[320])).
% fof(330, plain,![X1]:![X2]:((~(leq(X1,X2))|gt(succ(X2),X1))&(~(gt(succ(X2),X1))|leq(X1,X2))),inference(fof_nnf,[status(thm)],[63])).
% fof(331, plain,![X3]:![X4]:((~(leq(X3,X4))|gt(succ(X4),X3))&(~(gt(succ(X4),X3))|leq(X3,X4))),inference(variable_rename,[status(thm)],[330])).
% cnf(333,plain,(gt(succ(X1),X2)|~leq(X2,X1)),inference(split_conjunct,[status(thm)],[331])).
% fof(374, negated_conjecture,?[X5]:((leq(n0,X5)&leq(X5,tptp_minus_1))&~(sum(n0,n4,a_select3(q,X5,tptp_sum_index))=n1)),inference(fof_nnf,[status(thm)],[86])).
% fof(375, negated_conjecture,?[X6]:((leq(n0,X6)&leq(X6,tptp_minus_1))&~(sum(n0,n4,a_select3(q,X6,tptp_sum_index))=n1)),inference(variable_rename,[status(thm)],[374])).
% fof(376, negated_conjecture,((leq(n0,esk24_0)&leq(esk24_0,tptp_minus_1))&~(sum(n0,n4,a_select3(q,esk24_0,tptp_sum_index))=n1)),inference(skolemize,[status(esa)],[375])).
% cnf(378,negated_conjecture,(leq(esk24_0,tptp_minus_1)),inference(split_conjunct,[status(thm)],[376])).
% cnf(379,negated_conjecture,(leq(n0,esk24_0)),inference(split_conjunct,[status(thm)],[376])).
% cnf(414,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[129,319,theory(equality)]),['unfolding']).
% cnf(417,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[321,319,theory(equality)]),['unfolding']).
% cnf(434,plain,(gt(plus(X1,n1),X2)|~leq(X2,X1)),inference(rw,[status(thm)],[333,319,theory(equality)]),['unfolding']).
% cnf(438,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[414,417,theory(equality)])).
% cnf(505,negated_conjecture,(leq(X1,tptp_minus_1)|~leq(X1,esk24_0)),inference(spm,[status(thm)],[94,378,theory(equality)])).
% cnf(537,plain,(~leq(plus(X1,n1),X1)),inference(spm,[status(thm)],[268,434,theory(equality)])).
% cnf(4875,plain,(~leq(plus(n1,X1),X1)),inference(spm,[status(thm)],[537,417,theory(equality)])).
% cnf(6350,plain,(~leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[4875,438,theory(equality)])).
% cnf(8444,negated_conjecture,(leq(n0,tptp_minus_1)),inference(spm,[status(thm)],[505,379,theory(equality)])).
% cnf(8448,negated_conjecture,($false),inference(sr,[status(thm)],[8444,6350,theory(equality)])).
% cnf(8449,negated_conjecture,($false),8448,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 438
% # ...of these trivial : 0
% # ...subsumed : 15
% # ...remaining for further processing: 423
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 4867
% # ...of the previous two non-trivial : 4825
% # Contextual simplify-reflections : 0
% # Paramodulations : 4854
% # Factorizations : 2
% # Equation resolutions : 11
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 65
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 13
% # Non-unit-clauses : 145
% # Current number of unprocessed clauses: 4773
% # ...number of literals in the above : 30713
% # Clause-clause subsumption calls (NU) : 3490
% # Rec. Clause-clause subsumption calls : 1296
% # Unit Clause-clause subsumption calls : 106
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 25
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 252 leaves, 1.25+/-1.474 terms/leaf
% # Paramod-from index: 96 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 147 leaves, 1.14+/-0.567 terms/leaf
% # -------------------------------------------------
% # User time : 0.284 s
% # System time : 0.012 s
% # Total time : 0.296 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.52 CPU 0.61 WC
% FINAL PrfWatch: 0.52 CPU 0.61 WC
% SZS output end Solution for /tmp/SystemOnTPTP8601/SWV151+1.tptp
%
%------------------------------------------------------------------------------