%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP747+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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 : Sat Dec 25 11:27:39 EST 2010
% Result : Theorem 0.92s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 21 unt; 0 def)
% Number of atoms : 69 ( 65 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 40 ( 11 ~; 22 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X1] : mult(unit,X1) = X1,
file('/tmp/tmprdNYOP/sel_GRP747+1.p_1',f06) ).
fof(5,axiom,
! [X2,X1] : mult(X1,ld(X1,X2)) = X2,
file('/tmp/tmprdNYOP/sel_GRP747+1.p_1',f01) ).
fof(6,conjecture,
mult(mult(a,b),c) = mult(a,mult(b,c)),
file('/tmp/tmprdNYOP/sel_GRP747+1.p_1',goals) ).
fof(8,axiom,
! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
file('/tmp/tmprdNYOP/sel_GRP747+1.p_1',f02) ).
fof(9,axiom,
! [X4,X5,X6] :
( ( mult(mult(X4,X5),X6) = mult(X4,mult(X6,X5))
& mult(mult(X4,X6),X5) = mult(X4,mult(X5,X6)) )
| ( mult(mult(X4,X5),X6) = mult(mult(X4,X6),X5)
& mult(X4,mult(X5,X6)) = mult(X4,mult(X6,X5)) ) ),
file('/tmp/tmprdNYOP/sel_GRP747+1.p_1',f08) ).
fof(10,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(assume_negation,[status(cth)],[6]) ).
fof(11,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(18,plain,
! [X2] : mult(unit,X2) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(19,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[18]) ).
fof(20,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[5]) ).
cnf(21,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
inference(split_conjunct,[status(thm)],[11]) ).
fof(25,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[8]) ).
cnf(26,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[25]) ).
fof(27,plain,
! [X7,X8,X9] :
( ( mult(mult(X7,X8),X9) = mult(X7,mult(X9,X8))
& mult(mult(X7,X9),X8) = mult(X7,mult(X8,X9)) )
| ( mult(mult(X7,X8),X9) = mult(mult(X7,X9),X8)
& mult(X7,mult(X8,X9)) = mult(X7,mult(X9,X8)) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(28,plain,
! [X7,X8,X9] :
( ( mult(mult(X7,X8),X9) = mult(mult(X7,X9),X8)
| mult(mult(X7,X8),X9) = mult(X7,mult(X9,X8)) )
& ( mult(X7,mult(X8,X9)) = mult(X7,mult(X9,X8))
| mult(mult(X7,X8),X9) = mult(X7,mult(X9,X8)) )
& ( mult(mult(X7,X8),X9) = mult(mult(X7,X9),X8)
| mult(mult(X7,X9),X8) = mult(X7,mult(X8,X9)) )
& ( mult(X7,mult(X8,X9)) = mult(X7,mult(X9,X8))
| mult(mult(X7,X9),X8) = mult(X7,mult(X8,X9)) ) ),
inference(distribute,[status(thm)],[27]) ).
cnf(29,plain,
( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
| mult(X1,mult(X3,X2)) = mult(X1,mult(X2,X3)) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
| mult(mult(X1,X3),X2) = mult(mult(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(62,plain,
( mult(mult(unit,X2),X1) = mult(X1,X2)
| mult(unit,mult(X2,X1)) = mult(unit,mult(X1,X2)) ),
inference(spm,[status(thm)],[19,29,theory(equality)]) ).
cnf(100,plain,
( mult(X2,X1) = mult(X1,X2)
| mult(unit,mult(X2,X1)) = mult(unit,mult(X1,X2)) ),
inference(rw,[status(thm)],[62,19,theory(equality)]) ).
cnf(101,plain,
( mult(X2,X1) = mult(X1,X2)
| mult(X2,X1) = mult(unit,mult(X1,X2)) ),
inference(rw,[status(thm)],[100,19,theory(equality)]) ).
cnf(102,plain,
( mult(X2,X1) = mult(X1,X2)
| mult(X2,X1) = mult(X1,X2) ),
inference(rw,[status(thm)],[101,19,theory(equality)]) ).
cnf(103,plain,
mult(X2,X1) = mult(X1,X2),
inference(cn,[status(thm)],[102,theory(equality)]) ).
cnf(117,plain,
( mult(mult(X1,X2),ld(X1,X3)) = mult(X3,X2)
| mult(mult(X1,X2),ld(X1,X3)) = mult(X1,mult(ld(X1,X3),X2)) ),
inference(spm,[status(thm)],[30,21,theory(equality)]) ).
cnf(243,plain,
ld(X1,mult(X2,X1)) = X2,
inference(spm,[status(thm)],[26,103,theory(equality)]) ).
cnf(248,plain,
( mult(X3,mult(X1,X2)) = mult(mult(X1,X3),X2)
| mult(X3,mult(X1,X2)) = mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[30,103,theory(equality)]) ).
cnf(259,negated_conjecture,
mult(c,mult(a,b)) != mult(a,mult(b,c)),
inference(rw,[status(thm)],[22,103,theory(equality)]) ).
cnf(1258,plain,
( mult(mult(X4,X5),ld(X4,X6)) = mult(X6,X5)
| mult(X4,mult(ld(X4,X6),X5)) != mult(X6,X5) ),
inference(ef,[status(thm)],[117,theory(equality)]) ).
cnf(1596,plain,
( mult(mult(X1,X2),X3) = mult(mult(X1,X3),X2)
| mult(X1,mult(X3,X2)) != mult(mult(X1,X3),X2) ),
inference(spm,[status(thm)],[1258,26,theory(equality)]) ).
cnf(1599,plain,
( mult(mult(X1,X2),X3) = mult(mult(X3,X1),X2)
| mult(X1,mult(X3,X2)) != mult(mult(X3,X1),X2) ),
inference(spm,[status(thm)],[1258,243,theory(equality)]) ).
cnf(1660,plain,
( mult(mult(X1,X2),X3) = mult(X2,mult(X1,X3))
| mult(X2,mult(X1,X3)) != mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[1596,103,theory(equality)]) ).
cnf(1718,plain,
( mult(mult(X1,X2),X3) = mult(X2,mult(X1,X3))
| mult(X2,mult(X1,X3)) != mult(X1,mult(X2,X3)) ),
inference(spm,[status(thm)],[1660,103,theory(equality)]) ).
cnf(17537,plain,
mult(mult(X1,X3),X2) = mult(X3,mult(X1,X2)),
inference(csr,[status(thm)],[248,1718]) ).
cnf(17663,plain,
( mult(X2,mult(X1,X3)) = mult(mult(X3,X1),X2)
| mult(mult(X3,X1),X2) != mult(X1,mult(X3,X2)) ),
inference(rw,[status(thm)],[1599,17537,theory(equality)]) ).
cnf(17664,plain,
( mult(X2,mult(X1,X3)) = mult(X1,mult(X3,X2))
| mult(mult(X3,X1),X2) != mult(X1,mult(X3,X2)) ),
inference(rw,[status(thm)],[17663,17537,theory(equality)]) ).
cnf(17665,plain,
( mult(X2,mult(X1,X3)) = mult(X1,mult(X3,X2))
| $false ),
inference(rw,[status(thm)],[17664,17537,theory(equality)]) ).
cnf(17666,plain,
mult(X2,mult(X1,X3)) = mult(X1,mult(X3,X2)),
inference(cn,[status(thm)],[17665,theory(equality)]) ).
cnf(21729,negated_conjecture,
$false,
inference(rw,[status(thm)],[259,17666,theory(equality)]) ).
cnf(21730,negated_conjecture,
$false,
inference(cn,[status(thm)],[21729,theory(equality)]) ).
cnf(21731,negated_conjecture,
$false,
21730,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP747+1.p
% --creating new selector for []
% -running prover on /tmp/tmprdNYOP/sel_GRP747+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP747+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP747+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP747+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------