TSTP Solution File: SWV046+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV046+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:16:45 EST 2010
% Result : Theorem 1.65s
% Output : Solution 1.65s
% 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/SystemOnTPTP29472/SWV046+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29472/SWV046+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29472/SWV046+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 29568
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X4]:![X5]:a_select2(tptp_update2(X1,X4,X5),X4)=X5,file('/tmp/SRASS.s.p', sel2_update_1)).
% fof(7, axiom,true,file('/tmp/SRASS.s.p', ttrue)).
% fof(24, axiom,![X1]:minus(X1,n1)=pred(X1),file('/tmp/SRASS.s.p', pred_minus_1)).
% fof(26, axiom,![X16]:sum(n0,tptp_minus_1,X16)=n0,file('/tmp/SRASS.s.p', sum_plus_base)).
% fof(52, axiom,succ(tptp_minus_1)=n0,file('/tmp/SRASS.s.p', succ_tptp_minus_1)).
% fof(57, axiom,![X1]:plus(X1,n1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_r)).
% fof(58, axiom,![X1]:plus(n1,X1)=succ(X1),file('/tmp/SRASS.s.p', succ_plus_1_l)).
% fof(63, axiom,![X1]:pred(succ(X1))=X1,file('/tmp/SRASS.s.p', pred_succ)).
% fof(92, conjecture,((((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&pv80=sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))=>((~(n0=pv44)=>(((n0=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))&pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)))&leq(n0,pv35))&leq(pv35,minus(n5,n1))))&(n0=pv44=>true))),file('/tmp/SRASS.s.p', cl5_nebula_norm_0010)).
% fof(93, negated_conjecture,~(((((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&pv80=sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))=>((~(n0=pv44)=>(((n0=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))&pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)))&leq(n0,pv35))&leq(pv35,minus(n5,n1))))&(n0=pv44=>true)))),inference(assume_negation,[status(cth)],[92])).
% fof(105, plain,![X6]:![X7]:![X8]:a_select2(tptp_update2(X6,X7,X8),X7)=X8,inference(variable_rename,[status(thm)],[4])).
% cnf(106,plain,(a_select2(tptp_update2(X1,X2,X3),X2)=X3),inference(split_conjunct,[status(thm)],[105])).
% cnf(117,plain,(true),inference(split_conjunct,[status(thm)],[7])).
% fof(233, plain,![X2]:minus(X2,n1)=pred(X2),inference(variable_rename,[status(thm)],[24])).
% cnf(234,plain,(minus(X1,n1)=pred(X1)),inference(split_conjunct,[status(thm)],[233])).
% fof(236, plain,![X17]:sum(n0,tptp_minus_1,X17)=n0,inference(variable_rename,[status(thm)],[26])).
% cnf(237,plain,(sum(n0,tptp_minus_1,X1)=n0),inference(split_conjunct,[status(thm)],[236])).
% cnf(324,plain,(succ(tptp_minus_1)=n0),inference(split_conjunct,[status(thm)],[52])).
% fof(329, plain,![X2]:plus(X2,n1)=succ(X2),inference(variable_rename,[status(thm)],[57])).
% cnf(330,plain,(plus(X1,n1)=succ(X1)),inference(split_conjunct,[status(thm)],[329])).
% fof(331, plain,![X2]:plus(n1,X2)=succ(X2),inference(variable_rename,[status(thm)],[58])).
% cnf(332,plain,(plus(n1,X1)=succ(X1)),inference(split_conjunct,[status(thm)],[331])).
% fof(339, plain,![X2]:pred(succ(X2))=X2,inference(variable_rename,[status(thm)],[63])).
% cnf(340,plain,(pred(succ(X1))=X1),inference(split_conjunct,[status(thm)],[339])).
% fof(388, negated_conjecture,((((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&pv80=sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))&((~(n0=pv44)&(((~(n0=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))|(n0=pv44&~(true)))),inference(fof_nnf,[status(thm)],[93])).
% fof(389, negated_conjecture,((((pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))&pv80=sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))))&leq(n0,pv35))&leq(pv35,minus(n5,n1)))&(((n0=pv44|~(n0=pv44))&(~(true)|~(n0=pv44)))&((n0=pv44|(((~(n0=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))&(~(true)|(((~(n0=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))))|~(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))))|~(leq(n0,pv35)))|~(leq(pv35,minus(n5,n1)))))))),inference(distribute,[status(thm)],[388])).
% cnf(391,negated_conjecture,(n0=pv44|~leq(pv35,minus(n5,n1))|~leq(n0,pv35)|pv78!=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))|n0!=sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))),inference(split_conjunct,[status(thm)],[389])).
% cnf(392,negated_conjecture,(n0!=pv44|~true),inference(split_conjunct,[status(thm)],[389])).
% cnf(394,negated_conjecture,(leq(pv35,minus(n5,n1))),inference(split_conjunct,[status(thm)],[389])).
% cnf(395,negated_conjecture,(leq(n0,pv35)),inference(split_conjunct,[status(thm)],[389])).
% cnf(397,negated_conjecture,(pv78=sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))),inference(split_conjunct,[status(thm)],[389])).
% cnf(428,plain,(minus(succ(X1),n1)=X1),inference(rw,[status(thm)],[340,234,theory(equality)]),['unfolding']).
% cnf(432,plain,(plus(tptp_minus_1,n1)=n0),inference(rw,[status(thm)],[324,330,theory(equality)]),['unfolding']).
% cnf(434,plain,(minus(plus(X1,n1),n1)=X1),inference(rw,[status(thm)],[428,330,theory(equality)]),['unfolding']).
% cnf(435,plain,(plus(n1,X1)=plus(X1,n1)),inference(rw,[status(thm)],[332,330,theory(equality)]),['unfolding']).
% cnf(455,negated_conjecture,(pv44!=n0|$false),inference(rw,[status(thm)],[392,117,theory(equality)])).
% cnf(456,negated_conjecture,(pv44!=n0),inference(cn,[status(thm)],[455,theory(equality)])).
% cnf(459,plain,(plus(n1,tptp_minus_1)=n0),inference(rw,[status(thm)],[432,435,theory(equality)])).
% cnf(473,negated_conjecture,(pv44=n0|$false|sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))!=n0|~leq(n0,pv35)|~leq(pv35,minus(n5,n1))),inference(rw,[status(thm)],[391,397,theory(equality)])).
% cnf(474,negated_conjecture,(pv44=n0|$false|sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35))))!=n0|~leq(n0,pv35)|~leq(pv35,minus(n5,n1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[473,106,theory(equality)]),106,theory(equality)])).
% cnf(475,negated_conjecture,(pv44=n0|$false|sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35))))!=n0|$false|~leq(pv35,minus(n5,n1))),inference(rw,[status(thm)],[474,395,theory(equality)])).
% cnf(476,negated_conjecture,(pv44=n0|$false|sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35))))!=n0|$false|$false),inference(rw,[status(thm)],[475,394,theory(equality)])).
% cnf(477,negated_conjecture,(pv44=n0|sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35))))!=n0),inference(cn,[status(thm)],[476,theory(equality)])).
% cnf(478,negated_conjecture,(sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35))))!=n0),inference(sr,[status(thm)],[477,456,theory(equality)])).
% cnf(523,plain,(minus(plus(n1,X1),n1)=X1),inference(spm,[status(thm)],[434,435,theory(equality)])).
% cnf(10483,plain,(minus(n0,n1)=tptp_minus_1),inference(spm,[status(thm)],[523,459,theory(equality)])).
% cnf(10774,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[478,10483,theory(equality)]),237,theory(equality)])).
% cnf(10775,negated_conjecture,($false),inference(cn,[status(thm)],[10774,theory(equality)])).
% cnf(10776,negated_conjecture,($false),10775,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 491
% # ...of these trivial : 6
% # ...subsumed : 25
% # ...remaining for further processing: 460
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 5705
% # ...of the previous two non-trivial : 5654
% # Contextual simplify-reflections : 0
% # Paramodulations : 5694
% # Factorizations : 2
% # Equation resolutions : 9
% # Current number of processed clauses: 252
% # Positive orientable unit clauses: 88
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 16
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 5489
% # ...number of literals in the above : 34634
% # Clause-clause subsumption calls (NU) : 4824
% # Rec. Clause-clause subsumption calls : 1416
% # Unit Clause-clause subsumption calls : 109
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 285 leaves, 1.22+/-1.389 terms/leaf
% # Paramod-from index: 119 leaves, 1.03+/-0.180 terms/leaf
% # Paramod-into index: 180 leaves, 1.11+/-0.515 terms/leaf
% # -------------------------------------------------
% # User time : 0.326 s
% # System time : 0.013 s
% # Total time : 0.339 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.59 CPU 0.67 WC
% FINAL PrfWatch: 0.59 CPU 0.67 WC
% SZS output end Solution for /tmp/SystemOnTPTP29472/SWV046+1.tptp
%
%------------------------------------------------------------------------------