%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP665+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:21:56 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 24 unt; 0 def)
% Number of atoms : 59 ( 54 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 29 ~; 19 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X2,X1] : rd(mult(X1,X2),X2) = X1,
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',f04) ).
fof(3,axiom,
! [X3,X2,X1] : mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',f07) ).
fof(6,conjecture,
! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',goals) ).
fof(8,axiom,
! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',f02) ).
fof(9,axiom,
! [X1] : mult(op_c,X1) = mult(X1,op_c),
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',f09) ).
fof(10,axiom,
! [X3,X2,X1] : mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
file('/tmp/tmpTcT75e/sel_GRP665+1.p_1',f08) ).
fof(11,negated_conjecture,
~ ! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(14,plain,
! [X3,X4] : rd(mult(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[2]) ).
cnf(15,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X4,X5,X6] : mult(X6,mult(X5,X4)) = mult(rd(mult(X6,X5),X6),mult(X6,X4)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(17,plain,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
inference(split_conjunct,[status(thm)],[16]) ).
fof(22,negated_conjecture,
? [X4,X5] :
( mult(op_c,mult(X4,X5)) != mult(mult(op_c,X4),X5)
| mult(mult(X4,op_c),X5) != mult(X4,mult(op_c,X5))
| mult(mult(X4,X5),op_c) != mult(X4,mult(X5,op_c)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(23,negated_conjecture,
? [X6,X7] :
( mult(op_c,mult(X6,X7)) != mult(mult(op_c,X6),X7)
| mult(mult(X6,op_c),X7) != mult(X6,mult(op_c,X7))
| mult(mult(X6,X7),op_c) != mult(X6,mult(X7,op_c)) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0)
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
inference(skolemize,[status(esa)],[23]) ).
cnf(25,negated_conjecture,
( mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c))
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[8]) ).
cnf(29,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X2] : mult(op_c,X2) = mult(X2,op_c),
inference(variable_rename,[status(thm)],[9]) ).
cnf(31,plain,
mult(op_c,X1) = mult(X1,op_c),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X4,X5,X6] : mult(mult(X6,X5),X4) = mult(mult(X6,X4),ld(X4,mult(X5,X4))),
inference(variable_rename,[status(thm)],[10]) ).
cnf(33,plain,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(62,plain,
mult(mult(X1,X2),ld(X2,mult(X2,op_c))) = mult(mult(X1,op_c),X2),
inference(spm,[status(thm)],[33,31,theory(equality)]) ).
cnf(72,plain,
mult(op_c,mult(X1,X2)) = mult(mult(X1,op_c),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[62,29,theory(equality)]),31,theory(equality)]) ).
cnf(92,plain,
mult(rd(mult(X1,op_c),op_c),mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(spm,[status(thm)],[17,31,theory(equality)]) ).
cnf(103,plain,
mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[92,15,theory(equality)]) ).
cnf(105,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
inference(rw,[status(thm)],[25,31,theory(equality)]) ).
cnf(106,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(op_c,mult(esk1_0,esk2_0)) != mult(esk1_0,mult(esk2_0,op_c)) ),
inference(rw,[status(thm)],[105,31,theory(equality)]) ).
cnf(107,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(op_c,mult(esk1_0,esk2_0)) != mult(esk1_0,mult(op_c,esk2_0)) ),
inference(rw,[status(thm)],[106,31,theory(equality)]) ).
cnf(246,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
inference(spm,[status(thm)],[72,31,theory(equality)]) ).
cnf(283,negated_conjecture,
( $false
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[107,246,theory(equality)]) ).
cnf(284,negated_conjecture,
( $false
| mult(op_c,mult(esk1_0,esk2_0)) != mult(esk1_0,mult(op_c,esk2_0))
| mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[283,246,theory(equality)]) ).
cnf(285,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(esk1_0,mult(op_c,esk2_0))
| mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[284,theory(equality)]) ).
cnf(286,negated_conjecture,
mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)),
inference(cn,[status(thm)],[285,theory(equality)]) ).
cnf(335,negated_conjecture,
$false,
inference(rw,[status(thm)],[286,103,theory(equality)]) ).
cnf(336,negated_conjecture,
$false,
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(337,negated_conjecture,
$false,
336,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP665+1.p
% --creating new selector for []
% -running prover on /tmp/tmpTcT75e/sel_GRP665+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP665+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP665+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP665+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
%
%------------------------------------------------------------------------------