TSTP Solution File: SWV041+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV041+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 08:19:11 EST 2010
% Result : Theorem 1.92s
% Output : Solution 1.92s
% 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/SystemOnTPTP21121/SWV041+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21121/SWV041+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21121/SWV041+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 21253
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:((leq(n0,X1)&leq(X1,n0))=>X1=n0),file('/tmp/SRASS.s.p', finite_domain_0)).
% fof(36, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(44, axiom,![X1]:![X2]:(gt(X2,X1)=>leq(X1,X2)),file('/tmp/SRASS.s.p', leq_gt1)).
% fof(48, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(90, axiom,![X1]:![X2]:(leq(X1,pred(X2))<=>gt(X2,X1)),file('/tmp/SRASS.s.p', leq_gt_pred)).
% fof(100, conjecture,((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))=>![X11]:((leq(n0,X11)&leq(X11,n2))=>![X15]:((leq(n0,X15)&leq(X15,minus(n0,n1)))=>a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X15,X11)=init))),file('/tmp/SRASS.s.p', gauss_init_0077)).
% fof(101, negated_conjecture,~(((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))=>![X11]:((leq(n0,X11)&leq(X11,n2))=>![X15]:((leq(n0,X15)&leq(X15,minus(n0,n1)))=>a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X15,X11)=init)))),inference(assume_negation,[status(cth)],[100])).
% fof(102, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[48,theory(equality)])).
% fof(120, plain,![X1]:((~(leq(n0,X1))|~(leq(X1,n0)))|X1=n0),inference(fof_nnf,[status(thm)],[6])).
% fof(121, plain,![X2]:((~(leq(n0,X2))|~(leq(X2,n0)))|X2=n0),inference(variable_rename,[status(thm)],[120])).
% cnf(122,plain,(X1=n0|~leq(X1,n0)|~leq(n0,X1)),inference(split_conjunct,[status(thm)],[121])).
% fof(255, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[36])).
% cnf(256,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[255])).
% fof(291, plain,![X1]:![X2]:(~(gt(X2,X1))|leq(X1,X2)),inference(fof_nnf,[status(thm)],[44])).
% fof(292, plain,![X3]:![X4]:(~(gt(X4,X3))|leq(X3,X4)),inference(variable_rename,[status(thm)],[291])).
% cnf(293,plain,(leq(X1,X2)|~gt(X2,X1)),inference(split_conjunct,[status(thm)],[292])).
% fof(302, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[102])).
% cnf(303,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[302])).
% fof(384, plain,![X1]:![X2]:((~(leq(X1,pred(X2)))|gt(X2,X1))&(~(gt(X2,X1))|leq(X1,pred(X2)))),inference(fof_nnf,[status(thm)],[90])).
% fof(385, plain,![X3]:![X4]:((~(leq(X3,pred(X4)))|gt(X4,X3))&(~(gt(X4,X3))|leq(X3,pred(X4)))),inference(variable_rename,[status(thm)],[384])).
% cnf(387,plain,(gt(X1,X2)|~leq(X2,pred(X1))),inference(split_conjunct,[status(thm)],[385])).
% fof(404, negated_conjecture,((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))&?[X11]:((leq(n0,X11)&leq(X11,n2))&?[X15]:((leq(n0,X15)&leq(X15,minus(n0,n1)))&~(a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X15,X11)=init)))),inference(fof_nnf,[status(thm)],[101])).
% fof(405, negated_conjecture,((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))&?[X16]:((leq(n0,X16)&leq(X16,n2))&?[X17]:((leq(n0,X17)&leq(X17,minus(n0,n1)))&~(a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X16)=init)))),inference(variable_rename,[status(thm)],[404])).
% fof(406, negated_conjecture,((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))&((leq(n0,esk24_0)&leq(esk24_0,n2))&((leq(n0,esk25_0)&leq(esk25_0,minus(n0,n1)))&~(a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),esk25_0,esk24_0)=init)))),inference(skolemize,[status(esa)],[405])).
% cnf(408,negated_conjecture,(leq(esk25_0,minus(n0,n1))),inference(split_conjunct,[status(thm)],[406])).
% cnf(409,negated_conjecture,(leq(n0,esk25_0)),inference(split_conjunct,[status(thm)],[406])).
% cnf(445,plain,(gt(X1,X2)|~leq(X2,minus(X1,n1))),inference(rw,[status(thm)],[387,256,theory(equality)]),['unfolding']).
% cnf(548,negated_conjecture,(gt(n0,esk25_0)),inference(spm,[status(thm)],[445,408,theory(equality)])).
% cnf(11627,negated_conjecture,(leq(esk25_0,n0)),inference(spm,[status(thm)],[293,548,theory(equality)])).
% cnf(11711,negated_conjecture,(n0=esk25_0|~leq(n0,esk25_0)),inference(spm,[status(thm)],[122,11627,theory(equality)])).
% cnf(11872,negated_conjecture,(n0=esk25_0|$false),inference(rw,[status(thm)],[11711,409,theory(equality)])).
% cnf(11873,negated_conjecture,(n0=esk25_0),inference(cn,[status(thm)],[11872,theory(equality)])).
% cnf(11877,negated_conjecture,(gt(n0,n0)),inference(rw,[status(thm)],[548,11873,theory(equality)])).
% cnf(11878,negated_conjecture,($false),inference(sr,[status(thm)],[11877,303,theory(equality)])).
% cnf(11879,negated_conjecture,($false),11878,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 510
% # ...of these trivial : 3
% # ...subsumed : 22
% # ...remaining for further processing: 485
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 6502
% # ...of the previous two non-trivial : 6467
% # Contextual simplify-reflections : 0
% # Paramodulations : 6487
% # Factorizations : 4
% # Equation resolutions : 11
% # Current number of processed clauses: 264
% # Positive orientable unit clauses: 100
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 15
% # Non-unit-clauses : 144
% # Current number of unprocessed clauses: 6135
% # ...number of literals in the above : 38172
% # Clause-clause subsumption calls (NU) : 3490
% # Rec. Clause-clause subsumption calls : 1296
% # Unit Clause-clause subsumption calls : 233
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 290 leaves, 1.21+/-1.376 terms/leaf
% # Paramod-from index: 132 leaves, 1.02+/-0.149 terms/leaf
% # Paramod-into index: 186 leaves, 1.10+/-0.503 terms/leaf
% # -------------------------------------------------
% # User time : 0.325 s
% # System time : 0.015 s
% # Total time : 0.340 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.62 CPU 0.68 WC
% FINAL PrfWatch: 0.62 CPU 0.68 WC
% SZS output end Solution for /tmp/SystemOnTPTP21121/SWV041+1.tptp
%
%------------------------------------------------------------------------------