TSTP Solution File: NUM855+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM855+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 : Wed Dec 29 20:49:17 EST 2010
% Result : Theorem 25.94s
% Output : Solution 25.94s
% 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/SystemOnTPTP28397/NUM855+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28397/NUM855+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28397/NUM855+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 28493
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.54 CPU 4.03 WC
% PrfWatch: 5.19 CPU 6.03 WC
% PrfWatch: 7.19 CPU 8.04 WC
% PrfWatch: 9.18 CPU 10.04 WC
% PrfWatch: 11.17 CPU 12.05 WC
% PrfWatch: 13.16 CPU 14.05 WC
% PrfWatch: 15.14 CPU 16.06 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 17.13 CPU 18.06 WC
% PrfWatch: 19.12 CPU 20.06 WC
% PrfWatch: 21.11 CPU 22.07 WC
% PrfWatch: 23.10 CPU 24.07 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,greater(vmul(vd511,vd509),vmul(vd512,vd509)),file('/tmp/SRASS.s.p', 'holds(conjunct2(315), 515, 1)')).
% fof(2, axiom,greater(vmul(vd508,vd511),vmul(vd509,vd511)),file('/tmp/SRASS.s.p', 'holds(conjunct1(315), 514, 0)')).
% fof(12, axiom,![X15]:![X16]:vmul(X15,X16)=vmul(X16,X15),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(21, axiom,![X39]:![X40]:(less(X39,X40)=>greater(X40,X39)),file('/tmp/SRASS.s.p', 'ass(cond(147, 0), 0)')).
% fof(22, axiom,![X41]:![X42]:(greater(X41,X42)=>less(X42,X41)),file('/tmp/SRASS.s.p', 'ass(cond(140, 0), 0)')).
% fof(24, axiom,![X43]:![X44]:(greater(X44,X43)<=>?[X45]:X44=vplus(X43,X45)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(28, axiom,![X17]:![X18]:((X17=X18|greater(X17,X18))|less(X17,X18)),file('/tmp/SRASS.s.p', 'ass(cond(goal(130), 0), 0)')).
% fof(38, axiom,![X59]:![X60]:(~(?[X61]:X59=vplus(X60,X61))|~(?[X62]:X60=vplus(X59,X62))),file('/tmp/SRASS.s.p', 'ass(cond(goal(88), 0), 2)')).
% fof(42, axiom,![X68]:![X69]:vplus(X69,X68)=vplus(X68,X69),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(43, axiom,![X70]:![X71]:![X72]:vplus(vplus(X70,X71),X72)=vplus(X70,vplus(X71,X72)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(50, axiom,![X85]:![X86]:(less(X86,X85)<=>?[X87]:X85=vplus(X86,X87)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(63, conjecture,greater(vmul(vd508,vd511),vmul(vd509,vd512)),file('/tmp/SRASS.s.p', 'holds(conseq_conjunct2(315), 516, 0)')).
% fof(64, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd512))),inference(assume_negation,[status(cth)],[63])).
% fof(68, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd512))),inference(fof_simplification,[status(thm)],[64,theory(equality)])).
% cnf(69,plain,(greater(vmul(vd511,vd509),vmul(vd512,vd509))),inference(split_conjunct,[status(thm)],[1])).
% cnf(70,plain,(greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(split_conjunct,[status(thm)],[2])).
% fof(89, plain,![X17]:![X18]:vmul(X17,X18)=vmul(X18,X17),inference(variable_rename,[status(thm)],[12])).
% cnf(90,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[89])).
% fof(113, plain,![X39]:![X40]:(~(less(X39,X40))|greater(X40,X39)),inference(fof_nnf,[status(thm)],[21])).
% fof(114, plain,![X41]:![X42]:(~(less(X41,X42))|greater(X42,X41)),inference(variable_rename,[status(thm)],[113])).
% cnf(115,plain,(greater(X1,X2)|~less(X2,X1)),inference(split_conjunct,[status(thm)],[114])).
% fof(116, plain,![X41]:![X42]:(~(greater(X41,X42))|less(X42,X41)),inference(fof_nnf,[status(thm)],[22])).
% fof(117, plain,![X43]:![X44]:(~(greater(X43,X44))|less(X44,X43)),inference(variable_rename,[status(thm)],[116])).
% cnf(118,plain,(less(X1,X2)|~greater(X2,X1)),inference(split_conjunct,[status(thm)],[117])).
% fof(121, plain,![X43]:![X44]:((~(greater(X44,X43))|?[X45]:X44=vplus(X43,X45))&(![X45]:~(X44=vplus(X43,X45))|greater(X44,X43))),inference(fof_nnf,[status(thm)],[24])).
% fof(122, plain,![X46]:![X47]:((~(greater(X47,X46))|?[X48]:X47=vplus(X46,X48))&(![X49]:~(X47=vplus(X46,X49))|greater(X47,X46))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X46]:![X47]:((~(greater(X47,X46))|X47=vplus(X46,esk1_2(X46,X47)))&(![X49]:~(X47=vplus(X46,X49))|greater(X47,X46))),inference(skolemize,[status(esa)],[122])).
% fof(124, plain,![X46]:![X47]:![X49]:((~(X47=vplus(X46,X49))|greater(X47,X46))&(~(greater(X47,X46))|X47=vplus(X46,esk1_2(X46,X47)))),inference(shift_quantors,[status(thm)],[123])).
% cnf(125,plain,(X1=vplus(X2,esk1_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[124])).
% fof(134, plain,![X19]:![X20]:((X19=X20|greater(X19,X20))|less(X19,X20)),inference(variable_rename,[status(thm)],[28])).
% cnf(135,plain,(less(X1,X2)|greater(X1,X2)|X1=X2),inference(split_conjunct,[status(thm)],[134])).
% fof(168, plain,![X59]:![X60]:(![X61]:~(X59=vplus(X60,X61))|![X62]:~(X60=vplus(X59,X62))),inference(fof_nnf,[status(thm)],[38])).
% fof(169, plain,![X63]:![X64]:(![X65]:~(X63=vplus(X64,X65))|![X66]:~(X64=vplus(X63,X66))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X63]:![X64]:![X65]:![X66]:(~(X64=vplus(X63,X66))|~(X63=vplus(X64,X65))),inference(shift_quantors,[status(thm)],[169])).
% cnf(171,plain,(X1!=vplus(X2,X3)|X2!=vplus(X1,X4)),inference(split_conjunct,[status(thm)],[170])).
% fof(182, plain,![X70]:![X71]:vplus(X71,X70)=vplus(X70,X71),inference(variable_rename,[status(thm)],[42])).
% cnf(183,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(184, plain,![X73]:![X74]:![X75]:vplus(vplus(X73,X74),X75)=vplus(X73,vplus(X74,X75)),inference(variable_rename,[status(thm)],[43])).
% cnf(185,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[184])).
% fof(204, plain,![X85]:![X86]:((~(less(X86,X85))|?[X87]:X85=vplus(X86,X87))&(![X87]:~(X85=vplus(X86,X87))|less(X86,X85))),inference(fof_nnf,[status(thm)],[50])).
% fof(205, plain,![X88]:![X89]:((~(less(X89,X88))|?[X90]:X88=vplus(X89,X90))&(![X91]:~(X88=vplus(X89,X91))|less(X89,X88))),inference(variable_rename,[status(thm)],[204])).
% fof(206, plain,![X88]:![X89]:((~(less(X89,X88))|X88=vplus(X89,esk4_2(X88,X89)))&(![X91]:~(X88=vplus(X89,X91))|less(X89,X88))),inference(skolemize,[status(esa)],[205])).
% fof(207, plain,![X88]:![X89]:![X91]:((~(X88=vplus(X89,X91))|less(X89,X88))&(~(less(X89,X88))|X88=vplus(X89,esk4_2(X88,X89)))),inference(shift_quantors,[status(thm)],[206])).
% cnf(208,plain,(X1=vplus(X2,esk4_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[207])).
% cnf(245,negated_conjecture,(~greater(vmul(vd508,vd511),vmul(vd509,vd512))),inference(split_conjunct,[status(thm)],[68])).
% cnf(291,negated_conjecture,(~greater(vmul(vd511,vd508),vmul(vd509,vd512))),inference(rw,[status(thm)],[245,90,theory(equality)])).
% cnf(307,plain,(vplus(X2,X1)!=X3|vplus(X3,X4)!=X1),inference(pm,[status(thm)],[171,183,theory(equality)])).
% cnf(330,plain,(greater(vmul(vd509,vd511),vmul(vd509,vd512))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[69,90,theory(equality)]),90,theory(equality)])).
% cnf(333,plain,(greater(vmul(vd511,vd508),vmul(vd509,vd511))),inference(rw,[status(thm)],[70,90,theory(equality)])).
% cnf(339,plain,(greater(X1,X2)|X2=X1|greater(X2,X1)),inference(pm,[status(thm)],[115,135,theory(equality)])).
% cnf(393,plain,(vplus(vmul(vd509,vd512),esk1_2(vmul(vd509,vd512),vmul(vd509,vd511)))=vmul(vd509,vd511)),inference(pm,[status(thm)],[125,330,theory(equality)])).
% cnf(394,plain,(vplus(vmul(vd509,vd511),esk1_2(vmul(vd509,vd511),vmul(vd511,vd508)))=vmul(vd511,vd508)),inference(pm,[status(thm)],[125,333,theory(equality)])).
% cnf(831,plain,(vplus(vplus(X1,X2),X3)!=X2),inference(er,[status(thm)],[307,theory(equality)])).
% cnf(841,plain,(vplus(X1,vplus(X2,X3))!=X2),inference(rw,[status(thm)],[831,185,theory(equality)])).
% cnf(1569,negated_conjecture,(vmul(vd511,vd508)=vmul(vd509,vd512)|greater(vmul(vd509,vd512),vmul(vd511,vd508))),inference(pm,[status(thm)],[291,339,theory(equality)])).
% cnf(3635,plain,(vplus(X1,vmul(vd509,vd511))!=vmul(vd509,vd512)),inference(pm,[status(thm)],[841,393,theory(equality)])).
% cnf(3875,plain,(vplus(vmul(vd511,vd508),X1)=vplus(vmul(vd509,vd511),vplus(esk1_2(vmul(vd509,vd511),vmul(vd511,vd508)),X1))),inference(pm,[status(thm)],[185,394,theory(equality)])).
% cnf(28119,plain,(vplus(vmul(vd509,vd511),X1)!=vmul(vd509,vd512)),inference(pm,[status(thm)],[3635,183,theory(equality)])).
% cnf(154395,plain,(vmul(vd511,vd508)!=vmul(vd509,vd512)),inference(pm,[status(thm)],[28119,394,theory(equality)])).
% cnf(154425,negated_conjecture,(greater(vmul(vd509,vd512),vmul(vd511,vd508))),inference(sr,[status(thm)],[1569,154395,theory(equality)])).
% cnf(154465,negated_conjecture,(less(vmul(vd511,vd508),vmul(vd509,vd512))),inference(pm,[status(thm)],[118,154425,theory(equality)])).
% cnf(299939,plain,(vplus(vmul(vd511,vd508),X1)!=vmul(vd509,vd512)),inference(pm,[status(thm)],[28119,3875,theory(equality)])).
% cnf(662706,negated_conjecture,(vplus(vmul(vd511,vd508),esk4_2(vmul(vd509,vd512),vmul(vd511,vd508)))=vmul(vd509,vd512)),inference(pm,[status(thm)],[208,154465,theory(equality)])).
% cnf(662757,negated_conjecture,($false),inference(sr,[status(thm)],[662706,299939,theory(equality)])).
% cnf(662758,negated_conjecture,($false),662757,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 24628
% # ...of these trivial : 3090
% # ...subsumed : 15920
% # ...remaining for further processing: 5618
% # Other redundant clauses eliminated : 1846
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 54
% # Backward-rewritten : 596
% # Generated clauses : 487655
% # ...of the previous two non-trivial : 442593
% # Contextual simplify-reflections : 0
% # Paramodulations : 485436
% # Factorizations : 4
% # Equation resolutions : 2206
% # Current number of processed clauses: 4953
% # Positive orientable unit clauses: 1401
% # Positive unorientable unit clauses: 35
% # Negative unit clauses : 1069
% # Non-unit-clauses : 2448
% # Current number of unprocessed clauses: 388726
% # ...number of literals in the above : 926408
% # Clause-clause subsumption calls (NU) : 68336
% # Rec. Clause-clause subsumption calls : 64369
% # Unit Clause-clause subsumption calls : 16896
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4535
% # Indexed BW rewrite successes : 709
% # Backwards rewriting index: 2360 leaves, 1.68+/-2.421 terms/leaf
% # Paramod-from index: 1205 leaves, 1.42+/-1.014 terms/leaf
% # Paramod-into index: 2173 leaves, 1.61+/-2.305 terms/leaf
% # -------------------------------------------------
% # User time : 16.181 s
% # System time : 0.583 s
% # Total time : 16.763 s
% # Maximum resident set size: 0 pages
% PrfWatch: 24.96 CPU 25.94 WC
% FINAL PrfWatch: 24.96 CPU 25.94 WC
% SZS output end Solution for /tmp/SystemOnTPTP28397/NUM855+1.tptp
%
%------------------------------------------------------------------------------