%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP658+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:20:56 EST 2010
% Result : Theorem 0.36s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 40 unt; 0 def)
% Number of atoms : 52 ( 49 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 4 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 101 ( 0 sgn 27 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] : mult(mult(X3,mult(X2,X2)),X1) = mult(mult(X3,X2),mult(X2,X1)),
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',f05) ).
fof(2,axiom,
! [X2,X3] : rd(mult(X3,X2),X2) = X3,
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',f04) ).
fof(3,axiom,
! [X2,X3] : mult(X3,ld(X3,X2)) = X2,
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',f01) ).
fof(4,conjecture,
? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',goals) ).
fof(5,axiom,
! [X2,X3] : mult(rd(X3,X2),X2) = X3,
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',f03) ).
fof(6,axiom,
! [X2,X3] : ld(X3,mult(X3,X2)) = X2,
file('/tmp/tmpA_-FhN/sel_GRP658+1.p_1',f02) ).
fof(7,negated_conjecture,
~ ? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
inference(assume_negation,[status(cth)],[4]) ).
fof(8,plain,
! [X4,X5,X6] : mult(mult(X6,mult(X5,X5)),X4) = mult(mult(X6,X5),mult(X5,X4)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(9,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
inference(split_conjunct,[status(thm)],[8]) ).
fof(10,plain,
! [X4,X5] : rd(mult(X5,X4),X4) = X5,
inference(variable_rename,[status(thm)],[2]) ).
cnf(11,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,plain,
! [X4,X5] : mult(X5,ld(X5,X4)) = X4,
inference(variable_rename,[status(thm)],[3]) ).
cnf(13,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[12]) ).
fof(14,negated_conjecture,
! [X4] :
? [X5] :
( mult(X5,X4) != X5
| mult(X4,X5) != X5 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(15,negated_conjecture,
! [X6] :
? [X7] :
( mult(X7,X6) != X7
| mult(X6,X7) != X7 ),
inference(variable_rename,[status(thm)],[14]) ).
fof(16,negated_conjecture,
! [X6] :
( mult(esk1_1(X6),X6) != esk1_1(X6)
| mult(X6,esk1_1(X6)) != esk1_1(X6) ),
inference(skolemize,[status(esa)],[15]) ).
cnf(17,negated_conjecture,
( mult(X1,esk1_1(X1)) != esk1_1(X1)
| mult(esk1_1(X1),X1) != esk1_1(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,plain,
! [X4,X5] : mult(rd(X5,X4),X4) = X5,
inference(variable_rename,[status(thm)],[5]) ).
cnf(19,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5] : ld(X5,mult(X5,X4)) = X4,
inference(variable_rename,[status(thm)],[6]) ).
cnf(21,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[21,19,theory(equality)]) ).
cnf(27,plain,
rd(mult(mult(X1,X2),mult(X2,X3)),X3) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[11,9,theory(equality)]) ).
cnf(60,plain,
rd(mult(mult(X1,X2),X3),ld(X2,X3)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[27,13,theory(equality)]) ).
cnf(62,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(rd(X1,X2),mult(X2,X2)),
inference(spm,[status(thm)],[27,19,theory(equality)]) ).
cnf(63,plain,
rd(mult(mult(X1,rd(X2,X3)),X2),X3) = mult(X1,mult(rd(X2,X3),rd(X2,X3))),
inference(spm,[status(thm)],[27,19,theory(equality)]) ).
cnf(78,plain,
ld(mult(X1,mult(X2,X2)),mult(mult(X1,X2),X3)) = ld(X2,X3),
inference(spm,[status(thm)],[22,60,theory(equality)]) ).
cnf(491,plain,
mult(X1,mult(rd(X2,X2),rd(X2,X2))) = mult(X1,rd(X2,X2)),
inference(spm,[status(thm)],[11,63,theory(equality)]) ).
cnf(545,plain,
ld(mult(X1,rd(X2,X2)),mult(mult(X1,rd(X2,X2)),X3)) = ld(rd(X2,X2),X3),
inference(spm,[status(thm)],[78,491,theory(equality)]) ).
cnf(575,plain,
X3 = ld(rd(X2,X2),X3),
inference(rw,[status(thm)],[545,21,theory(equality)]) ).
cnf(596,plain,
mult(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[13,575,theory(equality)]) ).
cnf(627,negated_conjecture,
mult(esk1_1(rd(X1,X1)),rd(X1,X1)) != esk1_1(rd(X1,X1)),
inference(spm,[status(thm)],[17,596,theory(equality)]) ).
cnf(2754,plain,
mult(rd(mult(X1,mult(X2,X4)),X4),X3) = mult(mult(rd(X1,X2),X2),mult(X2,X3)),
inference(spm,[status(thm)],[9,62,theory(equality)]) ).
cnf(2783,plain,
rd(mult(X2,X3),X3) = mult(rd(rd(X1,X1),X2),mult(X2,X2)),
inference(spm,[status(thm)],[62,596,theory(equality)]) ).
cnf(2838,plain,
mult(rd(mult(X1,mult(X2,X4)),X4),X3) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[2754,19,theory(equality)]) ).
cnf(2864,plain,
X2 = mult(rd(rd(X1,X1),X2),mult(X2,X2)),
inference(rw,[status(thm)],[2783,11,theory(equality)]) ).
cnf(3039,plain,
rd(X2,mult(X2,X2)) = rd(rd(X1,X1),X2),
inference(spm,[status(thm)],[11,2864,theory(equality)]) ).
cnf(3186,plain,
ld(rd(X2,mult(X2,X2)),rd(X1,X1)) = X2,
inference(spm,[status(thm)],[22,3039,theory(equality)]) ).
cnf(3277,plain,
ld(rd(rd(X3,X3),X1),rd(X2,X2)) = X1,
inference(spm,[status(thm)],[3186,3039,theory(equality)]) ).
cnf(4549,plain,
mult(rd(X2,X2),X3) = mult(rd(rd(X1,X1),X2),mult(X2,X3)),
inference(spm,[status(thm)],[2838,2864,theory(equality)]) ).
cnf(4701,plain,
X3 = mult(rd(rd(X1,X1),X2),mult(X2,X3)),
inference(rw,[status(thm)],[4549,596,theory(equality)]) ).
cnf(4851,plain,
ld(rd(rd(X1,X1),X2),X3) = mult(X2,X3),
inference(spm,[status(thm)],[21,4701,theory(equality)]) ).
cnf(5003,plain,
mult(X2,rd(X3,X3)) = X2,
inference(rw,[status(thm)],[3277,4851,theory(equality)]) ).
cnf(5115,negated_conjecture,
$false,
inference(rw,[status(thm)],[627,5003,theory(equality)]) ).
cnf(5116,negated_conjecture,
$false,
inference(cn,[status(thm)],[5115,theory(equality)]) ).
cnf(5117,negated_conjecture,
$false,
5116,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP658+1.p
% --creating new selector for []
% -running prover on /tmp/tmpA_-FhN/sel_GRP658+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP658+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP658+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP658+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
%
%------------------------------------------------------------------------------