%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRP780+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 : 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 : Wed Dec 29 07:28:48 EST 2010
% Result : Theorem 2.00s
% Output : Solution 2.00s
% 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/SystemOnTPTP5632/GRP780+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5632/GRP780+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5632/GRP780+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 5764
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,d(a1,a2,a3),file('/tmp/SRASS.s.p', sos10)).
% fof(2, axiom,d(b1,b2,b3),file('/tmp/SRASS.s.p', sos11)).
% fof(3, axiom,d(c1,c2,c3),file('/tmp/SRASS.s.p', sos12)).
% fof(4, axiom,![X1]:![X2]:![X3]:bigC(X3,X2,X1)=product(product(X3,X2),product(X1,X3)),file('/tmp/SRASS.s.p', sos09)).
% fof(5, axiom,![X4]:![X5]:![X6]:(d(X4,X5,X6)<=>product(X4,X5)=product(X5,X6)),file('/tmp/SRASS.s.p', sos08)).
% fof(6, axiom,![X7]:![X1]:![X2]:![X3]:product(product(X3,X2),product(X1,X7))=product(product(X3,X1),product(X2,X7)),file('/tmp/SRASS.s.p', sos05)).
% fof(7, axiom,![X3]:product(X3,X3)=X3,file('/tmp/SRASS.s.p', sos06)).
% fof(8, axiom,![X2]:![X3]:product(product(product(X3,X2),X2),product(X2,product(X2,X3)))=X2,file('/tmp/SRASS.s.p', sos07)).
% fof(9, axiom,![X2]:![X3]:difference(X3,product(X3,X2))=X2,file('/tmp/SRASS.s.p', sos01)).
% fof(11, axiom,![X2]:![X3]:quotient(product(X3,X2),X2)=X3,file('/tmp/SRASS.s.p', sos03)).
% fof(12, axiom,![X2]:![X3]:product(quotient(X3,X2),X2)=X3,file('/tmp/SRASS.s.p', sos04)).
% fof(13, conjecture,d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),file('/tmp/SRASS.s.p', goals)).
% fof(14, negated_conjecture,~(d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1))),inference(assume_negation,[status(cth)],[13])).
% fof(15, negated_conjecture,~(d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% cnf(16,plain,(d(a1,a2,a3)),inference(split_conjunct,[status(thm)],[1])).
% cnf(17,plain,(d(b1,b2,b3)),inference(split_conjunct,[status(thm)],[2])).
% cnf(18,plain,(d(c1,c2,c3)),inference(split_conjunct,[status(thm)],[3])).
% fof(19, plain,![X4]:![X5]:![X6]:bigC(X6,X5,X4)=product(product(X6,X5),product(X4,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(20,plain,(bigC(X1,X2,X3)=product(product(X1,X2),product(X3,X1))),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:((~(d(X4,X5,X6))|product(X4,X5)=product(X5,X6))&(~(product(X4,X5)=product(X5,X6))|d(X4,X5,X6))),inference(fof_nnf,[status(thm)],[5])).
% fof(22, plain,![X7]:![X8]:![X9]:((~(d(X7,X8,X9))|product(X7,X8)=product(X8,X9))&(~(product(X7,X8)=product(X8,X9))|d(X7,X8,X9))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(d(X1,X2,X3)|product(X1,X2)!=product(X2,X3)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(product(X1,X2)=product(X2,X3)|~d(X1,X2,X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(25, plain,![X8]:![X9]:![X10]:![X11]:product(product(X11,X10),product(X9,X8))=product(product(X11,X9),product(X10,X8)),inference(variable_rename,[status(thm)],[6])).
% cnf(26,plain,(product(product(X1,X2),product(X3,X4))=product(product(X1,X3),product(X2,X4))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X4]:product(X4,X4)=X4,inference(variable_rename,[status(thm)],[7])).
% cnf(28,plain,(product(X1,X1)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:product(product(product(X5,X4),X4),product(X4,product(X4,X5)))=X4,inference(variable_rename,[status(thm)],[8])).
% cnf(30,plain,(product(product(product(X1,X2),X2),product(X2,product(X2,X1)))=X2),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:difference(X5,product(X5,X4))=X4,inference(variable_rename,[status(thm)],[9])).
% cnf(32,plain,(difference(X1,product(X1,X2))=X2),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X4]:![X5]:quotient(product(X5,X4),X4)=X5,inference(variable_rename,[status(thm)],[11])).
% cnf(36,plain,(quotient(product(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:product(quotient(X5,X4),X4)=X5,inference(variable_rename,[status(thm)],[12])).
% cnf(38,plain,(product(quotient(X1,X2),X2)=X1),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(~d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1))),inference(split_conjunct,[status(thm)],[15])).
% cnf(40,negated_conjecture,(~d(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[39,20,theory(equality)]),20,theory(equality)]),20,theory(equality)]),['unfolding']).
% cnf(41,plain,(difference(X1,X1)=X1),inference(spm,[status(thm)],[32,28,theory(equality)])).
% cnf(45,plain,(product(c1,c2)=product(c2,c3)),inference(spm,[status(thm)],[24,18,theory(equality)])).
% cnf(46,plain,(product(b1,b2)=product(b2,b3)),inference(spm,[status(thm)],[24,17,theory(equality)])).
% cnf(47,plain,(product(a1,a2)=product(a2,a3)),inference(spm,[status(thm)],[24,16,theory(equality)])).
% cnf(56,plain,(product(product(X1,X2),product(X2,product(X2,quotient(X1,X2))))=X2),inference(spm,[status(thm)],[30,38,theory(equality)])).
% cnf(86,plain,(product(product(X1,X2),product(X3,X2))=product(product(X1,X3),X2)),inference(spm,[status(thm)],[26,28,theory(equality)])).
% cnf(103,negated_conjecture,(product(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)))!=product(product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3)))),inference(spm,[status(thm)],[40,23,theory(equality)])).
% cnf(106,negated_conjecture,(product(product(product(a2,a3),product(b1,b2)),product(product(c3,a2),product(c1,a3)))!=product(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[103,26,theory(equality)]),26,theory(equality)])).
% cnf(107,negated_conjecture,(product(product(product(a2,a3),product(b1,b2)),product(product(c3,a2),product(c1,a3)))!=product(product(product(a1,a2),product(b3,b1)),product(product(c2,a1),product(c3,a2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[106,26,theory(equality)]),26,theory(equality)])).
% cnf(110,plain,(product(product(c1,c2),product(X1,X2))=product(product(c2,X1),product(c3,X2))),inference(spm,[status(thm)],[26,45,theory(equality)])).
% cnf(128,plain,(product(product(X1,X2),product(a1,a2))=product(product(X1,a2),product(X2,a3))),inference(spm,[status(thm)],[26,47,theory(equality)])).
% cnf(132,negated_conjecture,(product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3)))!=product(product(product(a1,a2),product(b3,b1)),product(product(c2,a1),product(c3,a2)))),inference(rw,[status(thm)],[107,47,theory(equality)])).
% cnf(927,plain,(product(product(X1,c3),product(c1,c2))=product(product(X1,c2),c3)),inference(spm,[status(thm)],[86,45,theory(equality)])).
% cnf(928,plain,(product(product(X1,b3),product(b1,b2))=product(product(X1,b2),b3)),inference(spm,[status(thm)],[86,46,theory(equality)])).
% cnf(952,plain,(product(X1,product(X2,X1))=product(product(X1,X2),X1)),inference(spm,[status(thm)],[86,28,theory(equality)])).
% cnf(975,plain,(product(product(X1,c1),product(c3,c2))=product(product(X1,c2),c3)),inference(rw,[status(thm)],[927,26,theory(equality)])).
% cnf(1149,plain,(product(product(X1,b1),product(b3,b2))=product(product(X1,b2),b3)),inference(rw,[status(thm)],[928,26,theory(equality)])).
% cnf(1770,plain,(product(product(c1,c2),c2)=product(c2,product(c3,c2))),inference(spm,[status(thm)],[952,45,theory(equality)])).
% cnf(1771,plain,(product(product(b1,b2),b2)=product(b2,product(b3,b2))),inference(spm,[status(thm)],[952,46,theory(equality)])).
% cnf(1798,plain,(quotient(product(c2,product(c3,c2)),c2)=product(c1,c2)),inference(spm,[status(thm)],[36,1770,theory(equality)])).
% cnf(1806,plain,(product(product(c2,product(c3,c2)),product(c2,product(c2,quotient(product(c1,c2),c2))))=c2),inference(spm,[status(thm)],[56,1770,theory(equality)])).
% cnf(1825,plain,(product(product(c2,product(c3,c2)),product(c2,product(c2,c1)))=c2),inference(rw,[status(thm)],[1806,36,theory(equality)])).
% cnf(1828,plain,(quotient(product(b2,product(b3,b2)),b2)=product(b1,b2)),inference(spm,[status(thm)],[36,1771,theory(equality)])).
% cnf(1836,plain,(product(product(b2,product(b3,b2)),product(b2,product(b2,quotient(product(b1,b2),b2))))=b2),inference(spm,[status(thm)],[56,1771,theory(equality)])).
% cnf(1855,plain,(product(product(b2,product(b3,b2)),product(b2,product(b2,b1)))=b2),inference(rw,[status(thm)],[1836,36,theory(equality)])).
% cnf(1887,plain,(product(c2,product(product(c3,c2),product(c2,c1)))=c2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1825,26,theory(equality)]),28,theory(equality)])).
% cnf(1888,plain,(difference(c2,c2)=product(product(c3,c2),product(c2,c1))),inference(spm,[status(thm)],[32,1887,theory(equality)])).
% cnf(1913,plain,(c2=product(product(c3,c2),product(c2,c1))),inference(rw,[status(thm)],[1888,41,theory(equality)])).
% cnf(1936,plain,(product(c2,product(c3,c2))=product(product(c3,c2),product(product(c2,c1),product(c3,c2)))),inference(spm,[status(thm)],[952,1913,theory(equality)])).
% cnf(1956,plain,(product(c2,product(c3,c2))=product(product(c3,c1),c2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1936,975,theory(equality)]),28,theory(equality)]),45,theory(equality)]),86,theory(equality)])).
% cnf(1963,plain,(quotient(product(c2,product(c3,c2)),c2)=product(c3,c1)),inference(spm,[status(thm)],[36,1956,theory(equality)])).
% cnf(2683,plain,(product(b2,product(product(b3,b2),product(b2,b1)))=b2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1855,26,theory(equality)]),28,theory(equality)])).
% cnf(2684,plain,(difference(b2,b2)=product(product(b3,b2),product(b2,b1))),inference(spm,[status(thm)],[32,2683,theory(equality)])).
% cnf(2715,plain,(b2=product(product(b3,b2),product(b2,b1))),inference(rw,[status(thm)],[2684,41,theory(equality)])).
% cnf(3189,plain,(product(b2,product(b3,b2))=product(product(b3,b2),product(product(b2,b1),product(b3,b2)))),inference(spm,[status(thm)],[952,2715,theory(equality)])).
% cnf(3220,plain,(product(b2,product(b3,b2))=product(product(b3,b1),b2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3189,1149,theory(equality)]),28,theory(equality)]),46,theory(equality)]),86,theory(equality)])).
% cnf(3228,plain,(quotient(product(b2,product(b3,b2)),b2)=product(b3,b1)),inference(spm,[status(thm)],[36,3220,theory(equality)])).
% cnf(4037,plain,(product(c1,c2)=product(c3,c1)),inference(rw,[status(thm)],[1963,1798,theory(equality)])).
% cnf(4668,plain,(product(b1,b2)=product(b3,b1)),inference(rw,[status(thm)],[3228,1828,theory(equality)])).
% cnf(4710,negated_conjecture,(product(product(product(a1,a2),product(b1,b2)),product(product(c2,a1),product(c3,a2)))!=product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3)))),inference(rw,[status(thm)],[132,4668,theory(equality)])).
% cnf(19954,negated_conjecture,(product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3)))!=product(product(product(a1,a2),product(b1,b2)),product(product(c1,a1),product(c2,a2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4710,110,theory(equality)]),26,theory(equality)])).
% cnf(25091,plain,(product(product(c1,c2),product(a1,a2))=product(product(c3,a2),product(c1,a3))),inference(spm,[status(thm)],[128,4037,theory(equality)])).
% cnf(25208,plain,(product(product(c1,a1),product(c2,a2))=product(product(c3,a2),product(c1,a3))),inference(rw,[status(thm)],[25091,26,theory(equality)])).
% cnf(25546,negated_conjecture,($false),inference(rw,[status(thm)],[19954,25208,theory(equality)])).
% cnf(25547,negated_conjecture,($false),inference(cn,[status(thm)],[25546,theory(equality)])).
% cnf(25548,negated_conjecture,($false),25547,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 599
% # ...of these trivial : 153
% # ...subsumed : 8
% # ...remaining for further processing: 438
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 109
% # Generated clauses : 19496
% # ...of the previous two non-trivial : 17866
% # Contextual simplify-reflections : 0
% # Paramodulations : 19496
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 316
% # Positive orientable unit clauses: 307
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 12321
% # ...number of literals in the above : 12321
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 349
% # Indexed BW rewrite successes : 111
% # Backwards rewriting index: 482 leaves, 1.20+/-1.034 terms/leaf
% # Paramod-from index: 301 leaves, 1.06+/-0.281 terms/leaf
% # Paramod-into index: 432 leaves, 1.18+/-0.901 terms/leaf
% # -------------------------------------------------
% # User time : 0.515 s
% # System time : 0.025 s
% # Total time : 0.540 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.98 CPU 1.06 WC
% FINAL PrfWatch: 0.98 CPU 1.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP5632/GRP780+1.tptp
%
%------------------------------------------------------------------------------