TSTP Solution File: GRP778+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP778+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 : art03.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 07:23:53 EST 2010
% Result : Theorem 21.37s
% Output : Solution 21.37s
% 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/SystemOnTPTP2492/GRP778+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2492/GRP778+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2492/GRP778+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 2588
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.04 WC
% PrfWatch: 9.89 CPU 10.04 WC
% PrfWatch: 11.89 CPU 12.05 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.88 CPU 14.05 WC
% PrfWatch: 15.87 CPU 16.05 WC
% PrfWatch: 17.49 CPU 18.06 WC
% PrfWatch: 19.15 CPU 20.06 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(m(X1,X2,X3)<=>product(product(X1,X2),product(X2,X3))=product(X1,X3)),file('/tmp/SRASS.s.p', sos09)).
% fof(2, axiom,![X4]:![X5]:![X6]:![X7]:product(product(X7,X6),product(X5,X4))=product(product(X7,X5),product(X6,X4)),file('/tmp/SRASS.s.p', sos05)).
% fof(3, axiom,![X7]:product(X7,X7)=X7,file('/tmp/SRASS.s.p', sos06)).
% fof(4, axiom,![X6]:![X7]:product(product(product(X7,X6),X6),product(X6,product(X6,X7)))=X6,file('/tmp/SRASS.s.p', sos07)).
% fof(5, axiom,![X8]:![X9]:![X10]:(d(X8,X9,X10)<=>product(X8,X9)=product(X9,X10)),file('/tmp/SRASS.s.p', sos08)).
% fof(6, axiom,d(a1,b2,c1),file('/tmp/SRASS.s.p', sos14)).
% fof(7, axiom,d(a1,b,c),file('/tmp/SRASS.s.p', sos10)).
% fof(8, axiom,d(a,b,c1),file('/tmp/SRASS.s.p', sos12)).
% fof(9, axiom,d(a,b1,c),file('/tmp/SRASS.s.p', sos11)).
% fof(12, axiom,![X6]:![X7]:difference(X7,product(X7,X6))=X6,file('/tmp/SRASS.s.p', sos01)).
% fof(13, axiom,![X6]:![X7]:product(X7,difference(X7,X6))=X6,file('/tmp/SRASS.s.p', sos02)).
% fof(14, axiom,![X6]:![X7]:quotient(product(X7,X6),X6)=X7,file('/tmp/SRASS.s.p', sos03)).
% fof(15, axiom,![X6]:![X7]:product(quotient(X7,X6),X6)=X7,file('/tmp/SRASS.s.p', sos04)).
% fof(16, conjecture,m(b1,b,b2),file('/tmp/SRASS.s.p', goals)).
% fof(17, negated_conjecture,~(m(b1,b,b2)),inference(assume_negation,[status(cth)],[16])).
% fof(18, negated_conjecture,~(m(b1,b,b2)),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(19, plain,![X1]:![X2]:![X3]:((~(m(X1,X2,X3))|product(product(X1,X2),product(X2,X3))=product(X1,X3))&(~(product(product(X1,X2),product(X2,X3))=product(X1,X3))|m(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(20, plain,![X4]:![X5]:![X6]:((~(m(X4,X5,X6))|product(product(X4,X5),product(X5,X6))=product(X4,X6))&(~(product(product(X4,X5),product(X5,X6))=product(X4,X6))|m(X4,X5,X6))),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(m(X1,X2,X3)|product(product(X1,X2),product(X2,X3))!=product(X1,X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, plain,![X8]:![X9]:![X10]:![X11]:product(product(X11,X10),product(X9,X8))=product(product(X11,X9),product(X10,X8)),inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(product(product(X1,X2),product(X3,X4))=product(product(X1,X3),product(X2,X4))),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X8]:product(X8,X8)=X8,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(product(X1,X1)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X8]:![X9]:product(product(product(X9,X8),X8),product(X8,product(X8,X9)))=X8,inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(product(product(product(X1,X2),X2),product(X2,product(X2,X1)))=X2),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X8]:![X9]:![X10]:((~(d(X8,X9,X10))|product(X8,X9)=product(X9,X10))&(~(product(X8,X9)=product(X9,X10))|d(X8,X9,X10))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X11]:![X12]:![X13]:((~(d(X11,X12,X13))|product(X11,X12)=product(X12,X13))&(~(product(X11,X12)=product(X12,X13))|d(X11,X12,X13))),inference(variable_rename,[status(thm)],[29])).
% cnf(32,plain,(product(X1,X2)=product(X2,X3)|~d(X1,X2,X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(d(a1,b2,c1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(34,plain,(d(a1,b,c)),inference(split_conjunct,[status(thm)],[7])).
% cnf(35,plain,(d(a,b,c1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(36,plain,(d(a,b1,c)),inference(split_conjunct,[status(thm)],[9])).
% fof(39, plain,![X8]:![X9]:difference(X9,product(X9,X8))=X8,inference(variable_rename,[status(thm)],[12])).
% cnf(40,plain,(difference(X1,product(X1,X2))=X2),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X8]:![X9]:product(X9,difference(X9,X8))=X8,inference(variable_rename,[status(thm)],[13])).
% cnf(42,plain,(product(X1,difference(X1,X2))=X2),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X8]:![X9]:quotient(product(X9,X8),X8)=X9,inference(variable_rename,[status(thm)],[14])).
% cnf(44,plain,(quotient(product(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X8]:![X9]:product(quotient(X9,X8),X8)=X9,inference(variable_rename,[status(thm)],[15])).
% cnf(46,plain,(product(quotient(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(~m(b1,b,b2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(49,plain,(difference(quotient(X1,X2),X1)=X2),inference(spm,[status(thm)],[40,46,theory(equality)])).
% cnf(50,plain,(quotient(X2,difference(X1,X2))=X1),inference(spm,[status(thm)],[44,42,theory(equality)])).
% cnf(53,plain,(product(a,b1)=product(b1,c)),inference(spm,[status(thm)],[32,36,theory(equality)])).
% cnf(54,plain,(product(a,b)=product(b,c1)),inference(spm,[status(thm)],[32,35,theory(equality)])).
% cnf(56,plain,(product(a1,b)=product(b,c)),inference(spm,[status(thm)],[32,34,theory(equality)])).
% cnf(57,plain,(product(a1,b2)=product(b2,c1)),inference(spm,[status(thm)],[32,33,theory(equality)])).
% cnf(66,plain,(difference(product(product(X1,X2),X2),X2)=product(X2,product(X2,X1))),inference(spm,[status(thm)],[40,28,theory(equality)])).
% cnf(67,plain,(quotient(X2,product(X2,product(X2,X1)))=product(product(X1,X2),X2)),inference(spm,[status(thm)],[44,28,theory(equality)])).
% cnf(76,plain,(product(product(X1,X2),product(X2,product(X2,quotient(X1,X2))))=X2),inference(spm,[status(thm)],[28,46,theory(equality)])).
% cnf(82,plain,(difference(product(X1,X2),product(product(X1,X3),product(X2,X4)))=product(X3,X4)),inference(spm,[status(thm)],[40,24,theory(equality)])).
% cnf(88,plain,(product(product(X1,X2),product(product(X3,X5),product(X4,X6)))=product(product(X1,product(X3,X4)),product(X2,product(X5,X6)))),inference(spm,[status(thm)],[24,24,theory(equality)])).
% cnf(112,plain,(product(product(X1,X2),product(X3,X2))=product(product(X1,X3),X2)),inference(spm,[status(thm)],[24,26,theory(equality)])).
% cnf(115,plain,(product(product(X1,X2),product(difference(X1,X3),X4))=product(X3,product(X2,X4))),inference(spm,[status(thm)],[24,42,theory(equality)])).
% cnf(116,plain,(product(product(X1,X2),product(X1,X3))=product(X1,product(X2,X3))),inference(spm,[status(thm)],[24,26,theory(equality)])).
% cnf(183,plain,(quotient(product(a1,b2),c1)=b2),inference(spm,[status(thm)],[44,57,theory(equality)])).
% cnf(184,plain,(product(product(a1,b2),product(X1,X2))=product(product(b2,X1),product(c1,X2))),inference(spm,[status(thm)],[24,57,theory(equality)])).
% cnf(367,plain,(quotient(X1,product(X1,X2))=product(product(difference(X1,X2),X1),X1)),inference(spm,[status(thm)],[67,42,theory(equality)])).
% cnf(698,plain,(product(product(X1,c),product(a1,b))=product(product(X1,b),c)),inference(spm,[status(thm)],[112,56,theory(equality)])).
% cnf(722,plain,(product(X1,product(X2,X1))=product(product(X1,X2),X1)),inference(spm,[status(thm)],[112,26,theory(equality)])).
% cnf(921,plain,(difference(product(X1,X2),product(X1,product(X2,X1)))=X1),inference(spm,[status(thm)],[40,722,theory(equality)])).
% cnf(922,plain,(quotient(product(X1,product(X2,X1)),X1)=product(X1,X2)),inference(spm,[status(thm)],[44,722,theory(equality)])).
% cnf(968,plain,(product(X2,X1)=product(X1,product(difference(X1,X2),X1))),inference(spm,[status(thm)],[722,42,theory(equality)])).
% cnf(1470,plain,(quotient(product(X1,X2),X1)=product(X1,quotient(X2,X1))),inference(spm,[status(thm)],[922,46,theory(equality)])).
% cnf(1515,plain,(difference(product(X1,quotient(X2,X1)),product(X1,X2))=X1),inference(spm,[status(thm)],[921,46,theory(equality)])).
% cnf(1664,plain,(difference(X1,product(X2,X1))=product(difference(X1,X2),X1)),inference(spm,[status(thm)],[40,968,theory(equality)])).
% cnf(1665,plain,(quotient(product(X2,X1),product(difference(X1,X2),X1))=X1),inference(spm,[status(thm)],[44,968,theory(equality)])).
% cnf(1861,plain,(quotient(product(a,b1),b1)=product(b1,quotient(c,b1))),inference(spm,[status(thm)],[1470,53,theory(equality)])).
% cnf(1863,plain,(quotient(product(a1,b),b)=product(b,quotient(c,b))),inference(spm,[status(thm)],[1470,56,theory(equality)])).
% cnf(1864,plain,(quotient(product(a,b),b)=product(b,quotient(c1,b))),inference(spm,[status(thm)],[1470,54,theory(equality)])).
% cnf(1865,plain,(quotient(product(a1,b2),b2)=product(b2,quotient(c1,b2))),inference(spm,[status(thm)],[1470,57,theory(equality)])).
% cnf(1883,plain,(quotient(X2,X1)=product(X1,quotient(difference(X1,X2),X1))),inference(spm,[status(thm)],[1470,42,theory(equality)])).
% cnf(1891,plain,(a=product(b1,quotient(c,b1))),inference(rw,[status(thm)],[1861,44,theory(equality)])).
% cnf(1893,plain,(a1=product(b,quotient(c,b))),inference(rw,[status(thm)],[1863,44,theory(equality)])).
% cnf(1894,plain,(a=product(b,quotient(c1,b))),inference(rw,[status(thm)],[1864,44,theory(equality)])).
% cnf(1895,plain,(a1=product(b2,quotient(c1,b2))),inference(rw,[status(thm)],[1865,44,theory(equality)])).
% cnf(1956,plain,(difference(b1,a)=quotient(c,b1)),inference(spm,[status(thm)],[40,1891,theory(equality)])).
% cnf(2021,plain,(product(difference(b1,a),b1)=c),inference(spm,[status(thm)],[46,1956,theory(equality)])).
% cnf(2200,plain,(difference(b,a1)=quotient(c,b)),inference(spm,[status(thm)],[40,1893,theory(equality)])).
% cnf(2259,plain,(difference(b,a)=quotient(c1,b)),inference(spm,[status(thm)],[40,1894,theory(equality)])).
% cnf(2327,plain,(product(difference(b,a1),b)=c),inference(spm,[status(thm)],[46,2200,theory(equality)])).
% cnf(2330,plain,(product(product(c,b),product(b,product(b,difference(b,a1))))=b),inference(spm,[status(thm)],[76,2200,theory(equality)])).
% cnf(2334,plain,(product(product(c,b),product(b,a1))=b),inference(rw,[status(thm)],[2330,42,theory(equality)])).
% cnf(2336,plain,(difference(b2,a1)=quotient(c1,b2)),inference(spm,[status(thm)],[40,1895,theory(equality)])).
% cnf(2645,plain,(product(difference(b,a),b)=c1),inference(spm,[status(thm)],[46,2259,theory(equality)])).
% cnf(2654,plain,(product(difference(b2,a1),b2)=c1),inference(spm,[status(thm)],[46,2336,theory(equality)])).
% cnf(5982,plain,(difference(X1,X2)=product(difference(X1,quotient(X2,X1)),X1)),inference(spm,[status(thm)],[1664,46,theory(equality)])).
% cnf(5984,plain,(difference(b1,c)=product(difference(b1,difference(b1,a)),b1)),inference(spm,[status(thm)],[1664,2021,theory(equality)])).
% cnf(5986,plain,(difference(b,c1)=product(difference(b,difference(b,a)),b)),inference(spm,[status(thm)],[1664,2645,theory(equality)])).
% cnf(5987,plain,(difference(b,c)=product(difference(b,difference(b,a1)),b)),inference(spm,[status(thm)],[1664,2327,theory(equality)])).
% cnf(5988,plain,(difference(b2,c1)=product(difference(b2,difference(b2,a1)),b2)),inference(spm,[status(thm)],[1664,2654,theory(equality)])).
% cnf(6182,plain,(product(product(b,X1),product(a1,b))=product(b,product(X1,c))),inference(spm,[status(thm)],[116,56,theory(equality)])).
% cnf(6226,plain,(product(product(a1,b),product(b,X1))=product(b,product(c,X1))),inference(spm,[status(thm)],[116,56,theory(equality)])).
% cnf(8216,plain,(product(b,product(X1,c))=product(product(b,a1),product(X1,b))),inference(spm,[status(thm)],[24,6182,theory(equality)])).
% cnf(9533,plain,(difference(product(difference(b1,c),b1),b1)=product(b1,product(b1,difference(b1,difference(b1,a))))),inference(spm,[status(thm)],[66,5984,theory(equality)])).
% cnf(9593,plain,(difference(product(difference(b1,c),b1),b1)=a),inference(rw,[status(thm)],[inference(rw,[status(thm)],[9533,42,theory(equality)]),42,theory(equality)])).
% cnf(9624,plain,(quotient(b1,a)=product(difference(b1,c),b1)),inference(spm,[status(thm)],[50,9593,theory(equality)])).
% cnf(13031,plain,(product(product(difference(b,c1),b),product(b,product(b,difference(b,difference(b,a)))))=b),inference(spm,[status(thm)],[28,5986,theory(equality)])).
% cnf(13100,plain,(product(product(difference(b,c1),b),a)=b),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13031,42,theory(equality)]),42,theory(equality)])).
% cnf(13132,plain,(quotient(b,a)=product(difference(b,c1),b)),inference(spm,[status(thm)],[44,13100,theory(equality)])).
% cnf(13361,plain,(product(product(b1,X1),c)=product(a,product(X1,b1))),inference(spm,[status(thm)],[115,2021,theory(equality)])).
% cnf(13368,plain,(product(product(b,X1),c1)=product(a,product(X1,b))),inference(spm,[status(thm)],[115,2645,theory(equality)])).
% cnf(13369,plain,(product(product(b,X1),c)=product(a1,product(X1,b))),inference(spm,[status(thm)],[115,2327,theory(equality)])).
% cnf(13370,plain,(product(product(b2,X1),c1)=product(a1,product(X1,b2))),inference(spm,[status(thm)],[115,2654,theory(equality)])).
% cnf(13685,plain,(product(X1,c)=product(a,product(difference(b1,X1),b1))),inference(spm,[status(thm)],[13361,42,theory(equality)])).
% cnf(13893,plain,(product(X1,c1)=product(a,product(difference(b,X1),b))),inference(spm,[status(thm)],[13368,42,theory(equality)])).
% cnf(14205,plain,(product(X1,c)=product(a1,product(difference(b,X1),b))),inference(spm,[status(thm)],[13369,42,theory(equality)])).
% cnf(14305,plain,(product(X1,c1)=product(a1,product(difference(b2,X1),b2))),inference(spm,[status(thm)],[13370,42,theory(equality)])).
% cnf(21400,plain,(product(a,quotient(b1,a))=product(c,c)),inference(spm,[status(thm)],[13685,9624,theory(equality)])).
% cnf(21409,plain,(product(a,quotient(b1,a))=c),inference(rw,[status(thm)],[21400,26,theory(equality)])).
% cnf(21437,plain,(product(c,a)=product(a,product(quotient(b1,a),a))),inference(spm,[status(thm)],[722,21409,theory(equality)])).
% cnf(21498,plain,(product(c,a)=product(a,b1)),inference(rw,[status(thm)],[21437,46,theory(equality)])).
% cnf(21515,plain,(difference(a,product(c,a))=b1),inference(spm,[status(thm)],[40,21498,theory(equality)])).
% cnf(21598,plain,(product(b1,c)=product(c,a)),inference(rw,[status(thm)],[53,21498,theory(equality)])).
% cnf(21599,plain,(product(difference(a,c),a)=b1),inference(rw,[status(thm)],[21515,1664,theory(equality)])).
% cnf(21877,plain,(difference(c,product(c,a))=product(difference(c,b1),c)),inference(spm,[status(thm)],[1664,21598,theory(equality)])).
% cnf(21924,plain,(a=product(difference(c,b1),c)),inference(rw,[status(thm)],[21877,40,theory(equality)])).
% cnf(22220,plain,(product(product(c,X1),a)=product(b1,product(X1,c))),inference(spm,[status(thm)],[115,21924,theory(equality)])).
% cnf(22341,plain,(product(product(a,X1),b1)=product(c,product(X1,a))),inference(spm,[status(thm)],[115,21599,theory(equality)])).
% cnf(27288,plain,(product(a,quotient(b,a))=product(c1,c1)),inference(spm,[status(thm)],[13893,13132,theory(equality)])).
% cnf(27296,plain,(product(a,quotient(b,a))=c1),inference(rw,[status(thm)],[27288,26,theory(equality)])).
% cnf(27396,plain,(difference(a,c1)=quotient(b,a)),inference(spm,[status(thm)],[40,27296,theory(equality)])).
% cnf(27473,plain,(product(c1,b1)=product(c,product(quotient(b,a),a))),inference(spm,[status(thm)],[22341,27296,theory(equality)])).
% cnf(27503,plain,(product(c1,b1)=product(c,b)),inference(rw,[status(thm)],[27473,46,theory(equality)])).
% cnf(27506,plain,(difference(c,product(c1,b1))=b),inference(spm,[status(thm)],[40,27503,theory(equality)])).
% cnf(27586,plain,(product(product(c1,b1),product(b,a1))=b),inference(rw,[status(thm)],[2334,27503,theory(equality)])).
% cnf(27630,plain,(difference(product(a,difference(a,c1)),product(a,b))=a),inference(spm,[status(thm)],[1515,27396,theory(equality)])).
% cnf(27642,plain,(difference(c1,product(a,b))=a),inference(rw,[status(thm)],[27630,42,theory(equality)])).
% cnf(27693,plain,(product(c1,a)=product(a,b)),inference(spm,[status(thm)],[42,27642,theory(equality)])).
% cnf(27788,plain,(product(b,c1)=product(c1,a)),inference(rw,[status(thm)],[54,27693,theory(equality)])).
% cnf(28146,plain,(difference(c1,product(c1,a))=product(difference(c1,b),c1)),inference(spm,[status(thm)],[1664,27788,theory(equality)])).
% cnf(28186,plain,(a=product(difference(c1,b),c1)),inference(rw,[status(thm)],[28146,40,theory(equality)])).
% cnf(28360,plain,(product(product(c1,X1),a)=product(b,product(X1,c1))),inference(spm,[status(thm)],[115,28186,theory(equality)])).
% cnf(34435,plain,(difference(a1,product(X1,c))=product(difference(b,X1),b)),inference(spm,[status(thm)],[40,14205,theory(equality)])).
% cnf(35028,plain,(product(product(b,a1),product(c1,b1))=product(b,product(c,c))),inference(spm,[status(thm)],[8216,27503,theory(equality)])).
% cnf(35083,plain,(product(product(b,a1),product(c1,b1))=product(a1,b)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[35028,26,theory(equality)]),56,theory(equality)])).
% cnf(35125,plain,(product(product(a1,b),product(b,a1))=product(product(b,a1),product(product(c1,b1),product(b,a1)))),inference(spm,[status(thm)],[722,35083,theory(equality)])).
% cnf(35202,plain,(product(b,product(c,a1))=product(product(b,a1),product(product(c1,b1),product(b,a1)))),inference(rw,[status(thm)],[35125,6226,theory(equality)])).
% cnf(35203,plain,(product(b,product(c,a1))=product(b,product(a1,b))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[35202,27586,theory(equality)]),722,theory(equality)])).
% cnf(35232,plain,(difference(b,product(b,product(a1,b)))=product(c,a1)),inference(spm,[status(thm)],[40,35203,theory(equality)])).
% cnf(35316,plain,(product(a1,b)=product(c,a1)),inference(rw,[status(thm)],[35232,40,theory(equality)])).
% cnf(35352,plain,(quotient(product(a1,b),a1)=c),inference(spm,[status(thm)],[44,35316,theory(equality)])).
% cnf(35407,plain,(difference(a1,product(a1,b))=product(difference(a1,c),a1)),inference(spm,[status(thm)],[1664,35316,theory(equality)])).
% cnf(35426,plain,(product(a1,quotient(b,a1))=c),inference(rw,[status(thm)],[35352,1470,theory(equality)])).
% cnf(35448,plain,(b=product(difference(a1,c),a1)),inference(rw,[status(thm)],[35407,40,theory(equality)])).
% cnf(36004,plain,(difference(a1,c)=quotient(b,a1)),inference(spm,[status(thm)],[40,35426,theory(equality)])).
% cnf(36212,plain,(difference(difference(a1,c),b)=a1),inference(spm,[status(thm)],[49,36004,theory(equality)])).
% cnf(51399,plain,(product(product(difference(b,c),b),product(b,product(b,difference(b,difference(b,a1)))))=b),inference(spm,[status(thm)],[28,5987,theory(equality)])).
% cnf(51487,plain,(product(product(difference(b,c),b),a1)=b),inference(rw,[status(thm)],[inference(rw,[status(thm)],[51399,42,theory(equality)]),42,theory(equality)])).
% cnf(51525,plain,(quotient(b,a1)=product(difference(b,c),b)),inference(spm,[status(thm)],[44,51487,theory(equality)])).
% cnf(51603,plain,(difference(a1,c)=product(difference(b,c),b)),inference(rw,[status(thm)],[51525,36004,theory(equality)])).
% cnf(52198,plain,(product(b,difference(a1,c))=product(c,b)),inference(spm,[status(thm)],[968,51603,theory(equality)])).
% cnf(52240,plain,(product(b,difference(a1,c))=product(c1,b1)),inference(rw,[status(thm)],[52198,27503,theory(equality)])).
% cnf(52278,plain,(quotient(product(c1,b1),product(difference(difference(a1,c),b),difference(a1,c)))=difference(a1,c)),inference(spm,[status(thm)],[1665,52240,theory(equality)])).
% cnf(52350,plain,(quotient(product(c1,b1),c)=difference(a1,c)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[52278,36212,theory(equality)]),42,theory(equality)])).
% cnf(55789,plain,(product(difference(c,difference(a1,c)),c)=difference(c,product(c1,b1))),inference(spm,[status(thm)],[5982,52350,theory(equality)])).
% cnf(55793,plain,(product(difference(c,difference(a1,c)),c)=b),inference(rw,[status(thm)],[55789,27506,theory(equality)])).
% cnf(77797,plain,(quotient(b,c)=difference(c,difference(a1,c))),inference(spm,[status(thm)],[44,55793,theory(equality)])).
% cnf(80953,plain,(product(c,quotient(b,c))=difference(a1,c)),inference(spm,[status(thm)],[42,77797,theory(equality)])).
% cnf(81079,plain,(product(difference(a1,c),a)=product(b1,product(quotient(b,c),c))),inference(spm,[status(thm)],[22220,80953,theory(equality)])).
% cnf(81143,plain,(product(difference(a1,c),a)=product(b1,b)),inference(rw,[status(thm)],[81079,46,theory(equality)])).
% cnf(86878,plain,(product(difference(b2,c1),b2)=quotient(b2,product(b2,difference(b2,a1)))),inference(spm,[status(thm)],[367,5988,theory(equality)])).
% cnf(86949,plain,(product(difference(b2,c1),b2)=quotient(b2,a1)),inference(rw,[status(thm)],[86878,42,theory(equality)])).
% cnf(95273,plain,(product(a1,quotient(b2,a1))=product(c1,c1)),inference(spm,[status(thm)],[14305,86949,theory(equality)])).
% cnf(95341,plain,(product(a1,quotient(b2,a1))=c1),inference(rw,[status(thm)],[95273,26,theory(equality)])).
% cnf(95342,plain,(difference(a1,c1)=quotient(b2,a1)),inference(spm,[status(thm)],[40,95341,theory(equality)])).
% cnf(95769,plain,(difference(product(a1,difference(a1,c1)),product(a1,b2))=a1),inference(spm,[status(thm)],[1515,95342,theory(equality)])).
% cnf(95776,plain,(difference(c1,product(a1,b2))=a1),inference(rw,[status(thm)],[95769,42,theory(equality)])).
% cnf(98311,plain,(product(c1,quotient(a1,c1))=quotient(product(a1,b2),c1)),inference(spm,[status(thm)],[1883,95776,theory(equality)])).
% cnf(98323,plain,(product(c1,quotient(a1,c1))=b2),inference(rw,[status(thm)],[98311,183,theory(equality)])).
% cnf(98934,plain,(product(b2,a)=product(b,product(quotient(a1,c1),c1))),inference(spm,[status(thm)],[28360,98323,theory(equality)])).
% cnf(99014,plain,(product(b2,a)=product(b,a1)),inference(rw,[status(thm)],[98934,46,theory(equality)])).
% cnf(99293,plain,(product(product(b2,X1),product(b,a1))=product(b2,product(X1,a))),inference(spm,[status(thm)],[116,99014,theory(equality)])).
% cnf(132544,plain,(product(b2,product(X1,a))=product(product(b2,b),product(X1,a1))),inference(spm,[status(thm)],[24,99293,theory(equality)])).
% cnf(134918,plain,(product(product(b2,b),b)=product(b2,product(difference(a1,c),a))),inference(spm,[status(thm)],[132544,35448,theory(equality)])).
% cnf(135035,plain,(product(product(b2,b),b)=product(b2,product(b1,b))),inference(rw,[status(thm)],[134918,81143,theory(equality)])).
% cnf(135173,plain,(product(product(b2,product(b1,b)),product(b,product(b,b2)))=b),inference(spm,[status(thm)],[28,135035,theory(equality)])).
% cnf(135886,plain,(product(product(b2,b),product(product(b1,b),product(b,b2)))=b),inference(rw,[status(thm)],[135173,88,theory(equality)])).
% cnf(135887,plain,(difference(product(b2,b),b)=product(product(b1,b),product(b,b2))),inference(spm,[status(thm)],[40,135886,theory(equality)])).
% cnf(272316,plain,(product(product(X1,a1),product(c1,b1))=product(product(X1,b),c)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[698,24,theory(equality)]),27503,theory(equality)])).
% cnf(272525,plain,(product(product(b2,b),c)=product(product(a1,b2),product(a1,b1))),inference(spm,[status(thm)],[184,272316,theory(equality)])).
% cnf(272578,plain,(product(product(b2,b),c)=product(a1,product(b2,b1))),inference(rw,[status(thm)],[272525,116,theory(equality)])).
% cnf(371828,plain,(difference(a1,product(a1,product(b2,b1)))=product(difference(b,product(b2,b)),b)),inference(spm,[status(thm)],[34435,272578,theory(equality)])).
% cnf(371856,plain,(product(b2,b1)=product(difference(b,product(b2,b)),b)),inference(rw,[status(thm)],[371828,40,theory(equality)])).
% cnf(371857,plain,(product(b2,b1)=quotient(b,product(b,b2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[371856,1664,theory(equality)]),367,theory(equality)])).
% cnf(371861,plain,(product(product(b2,b1),product(b,b2))=b),inference(spm,[status(thm)],[46,371857,theory(equality)])).
% cnf(372345,plain,(difference(product(b2,b),b)=product(b1,b2)),inference(spm,[status(thm)],[82,371861,theory(equality)])).
% cnf(372398,plain,(product(product(b1,b),product(b,b2))=product(b1,b2)),inference(rw,[status(thm)],[372345,135887,theory(equality)])).
% cnf(373451,plain,(m(b1,b,b2)),inference(spm,[status(thm)],[21,372398,theory(equality)])).
% cnf(373663,plain,($false),inference(sr,[status(thm)],[373451,47,theory(equality)])).
% cnf(373664,plain,($false),373663,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2720
% # ...of these trivial : 598
% # ...subsumed : 638
% # ...remaining for further processing: 1484
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 279
% # Generated clauses : 209000
% # ...of the previous two non-trivial : 202796
% # Contextual simplify-reflections : 0
% # Paramodulations : 209000
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1185
% # Positive orientable unit clauses: 831
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 1
% # Non-unit-clauses : 341
% # Current number of unprocessed clauses: 128234
% # ...number of literals in the above : 169446
% # Clause-clause subsumption calls (NU) : 3168
% # Rec. Clause-clause subsumption calls : 3168
% # Unit Clause-clause subsumption calls : 107
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1346
% # Indexed BW rewrite successes : 176
% # Backwards rewriting index: 1546 leaves, 1.31+/-1.773 terms/leaf
% # Paramod-from index: 996 leaves, 1.18+/-0.701 terms/leaf
% # Paramod-into index: 1229 leaves, 1.31+/-1.507 terms/leaf
% # -------------------------------------------------
% # User time : 12.200 s
% # System time : 0.376 s
% # Total time : 12.576 s
% # Maximum resident set size: 0 pages
% PrfWatch: 20.53 CPU 21.47 WC
% FINAL PrfWatch: 20.53 CPU 21.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP2492/GRP778+1.tptp
%
%------------------------------------------------------------------------------