TSTP Solution File: GRP700+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP700+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:23:34 EST 2010
% Result : Theorem 0.41s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 64 ( 58 unt; 0 def)
% Number of atoms : 70 ( 67 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 33 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : mult(X1,unit) = X1,
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f05) ).
fof(2,axiom,
! [X2,X1] : rd(mult(X1,X2),X2) = X1,
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f04) ).
fof(3,axiom,
! [X3,X2,X1] : mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f07) ).
fof(4,axiom,
! [X1] : mult(unit,X1) = X1,
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f06) ).
fof(5,axiom,
! [X2,X1] : mult(X1,ld(X1,X2)) = X2,
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f01) ).
fof(6,conjecture,
! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',goals) ).
fof(8,axiom,
! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f02) ).
fof(9,axiom,
! [X3,X2,X1] : mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
file('/tmp/tmpH6bDYZ/sel_GRP700+1.p_1',f08) ).
fof(10,negated_conjecture,
~ ! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
inference(assume_negation,[status(cth)],[6]) ).
fof(11,plain,
! [X2] : mult(X2,unit) = X2,
inference(variable_rename,[status(thm)],[1]) ).
cnf(12,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[11]) ).
fof(13,plain,
! [X3,X4] : rd(mult(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[2]) ).
cnf(14,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X4,X5,X6] : mult(mult(mult(X6,X5),X6),mult(X6,X4)) = mult(X6,mult(mult(mult(X5,X6),X6),X4)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(16,plain,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
inference(split_conjunct,[status(thm)],[15]) ).
fof(17,plain,
! [X2] : mult(unit,X2) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(18,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X3,X4] : mult(X4,ld(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[5]) ).
cnf(20,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[19]) ).
fof(21,negated_conjecture,
? [X4] :
! [X5] :
( mult(X5,X4) != unit
| mult(X4,X5) != unit ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(22,negated_conjecture,
? [X6] :
! [X7] :
( mult(X7,X6) != unit
| mult(X6,X7) != unit ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,negated_conjecture,
! [X7] :
( mult(X7,esk1_0) != unit
| mult(esk1_0,X7) != unit ),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,negated_conjecture,
( mult(esk1_0,X1) != unit
| mult(X1,esk1_0) != unit ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(27,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[8]) ).
cnf(28,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
! [X4,X5,X6] : mult(mult(X6,X5),mult(X5,mult(X4,X5))) = mult(mult(X6,mult(X5,mult(X5,X4))),X5),
inference(variable_rename,[status(thm)],[9]) ).
cnf(30,plain,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(32,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[28,12,theory(equality)]) ).
cnf(37,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[14,18,theory(equality)]) ).
cnf(38,plain,
rd(X2,ld(X1,X2)) = X1,
inference(spm,[status(thm)],[14,20,theory(equality)]) ).
cnf(39,plain,
mult(mult(X1,X1),mult(X1,X2)) = mult(X1,mult(mult(mult(unit,X1),X1),X2)),
inference(spm,[status(thm)],[16,12,theory(equality)]) ).
cnf(41,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(mult(X2,X1),X1),unit)),
inference(spm,[status(thm)],[16,12,theory(equality)]) ).
cnf(53,plain,
mult(mult(X1,X1),mult(X1,X2)) = mult(X1,mult(mult(X1,X1),X2)),
inference(rw,[status(thm)],[39,18,theory(equality)]) ).
cnf(56,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(rw,[status(thm)],[41,12,theory(equality)]) ).
cnf(66,plain,
mult(mult(X1,mult(X2,X2)),X2) = mult(mult(X1,X2),mult(X2,mult(unit,X2))),
inference(spm,[status(thm)],[30,12,theory(equality)]) ).
cnf(69,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(mult(unit,X1),mult(X1,mult(X2,X1))),
inference(spm,[status(thm)],[30,18,theory(equality)]) ).
cnf(85,plain,
mult(mult(X1,mult(X2,X2)),X2) = mult(mult(X1,X2),mult(X2,X2)),
inference(rw,[status(thm)],[66,18,theory(equality)]) ).
cnf(90,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[status(thm)],[69,18,theory(equality)]) ).
cnf(147,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(mult(X1,X1),ld(X1,X2))),
inference(spm,[status(thm)],[53,20,theory(equality)]) ).
cnf(229,plain,
rd(mult(X1,mult(mult(X2,X1),X1)),X1) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[14,56,theory(equality)]) ).
cnf(308,plain,
rd(mult(mult(X1,X2),mult(X2,X2)),X2) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[14,85,theory(equality)]) ).
cnf(355,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X1,mult(ld(X1,X2),X1))),
inference(spm,[status(thm)],[90,20,theory(equality)]) ).
cnf(495,plain,
ld(X1,mult(mult(X1,X1),X2)) = mult(mult(X1,X1),ld(X1,X2)),
inference(spm,[status(thm)],[28,147,theory(equality)]) ).
cnf(759,plain,
rd(mult(X1,mult(mult(mult(X2,X1),X1),X1)),X1) = mult(mult(X1,X2),mult(X1,X1)),
inference(spm,[status(thm)],[308,16,theory(equality)]) ).
cnf(789,plain,
mult(mult(X1,mult(X2,X1)),X1) = mult(mult(X1,X2),mult(X1,X1)),
inference(rw,[status(thm)],[759,229,theory(equality)]) ).
cnf(806,plain,
rd(mult(mult(X1,X2),mult(X1,X1)),X1) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[14,789,theory(equality)]) ).
cnf(1303,plain,
rd(mult(mult(mult(X1,X2),X1),mult(X1,X1)),X1) = mult(X1,mult(mult(X1,mult(ld(X1,X2),X1)),X1)),
inference(spm,[status(thm)],[806,355,theory(equality)]) ).
cnf(1334,plain,
mult(mult(X1,X2),mult(X1,X1)) = mult(X1,mult(mult(X1,mult(ld(X1,X2),X1)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1303,16,theory(equality)]),229,theory(equality)]),789,theory(equality)]) ).
cnf(1335,plain,
mult(mult(X1,X2),mult(X1,X1)) = mult(X1,mult(X2,mult(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1334,789,theory(equality)]),20,theory(equality)]) ).
cnf(1582,plain,
rd(mult(X1,mult(X2,mult(X1,X1))),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[806,1335,theory(equality)]) ).
cnf(3281,plain,
ld(X1,mult(X1,X1)) = mult(mult(X1,X1),ld(X1,unit)),
inference(spm,[status(thm)],[495,12,theory(equality)]) ).
cnf(3316,plain,
X1 = mult(mult(X1,X1),ld(X1,unit)),
inference(rw,[status(thm)],[3281,28,theory(equality)]) ).
cnf(3365,plain,
rd(mult(ld(X1,unit),mult(X1,ld(X1,unit))),ld(X1,unit)) = mult(mult(ld(X1,unit),mult(X1,X1)),ld(X1,unit)),
inference(spm,[status(thm)],[229,3316,theory(equality)]) ).
cnf(3403,plain,
unit = mult(mult(ld(X1,unit),mult(X1,X1)),ld(X1,unit)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3365,20,theory(equality)]),12,theory(equality)]),37,theory(equality)]) ).
cnf(3955,plain,
rd(unit,ld(X1,unit)) = mult(ld(X1,unit),mult(X1,X1)),
inference(spm,[status(thm)],[14,3403,theory(equality)]) ).
cnf(4001,plain,
X1 = mult(ld(X1,unit),mult(X1,X1)),
inference(rw,[status(thm)],[3955,38,theory(equality)]) ).
cnf(4085,plain,
rd(mult(X1,X1),X1) = mult(X1,mult(ld(X1,unit),X1)),
inference(spm,[status(thm)],[1582,4001,theory(equality)]) ).
cnf(4132,plain,
X1 = mult(X1,mult(ld(X1,unit),X1)),
inference(rw,[status(thm)],[4085,14,theory(equality)]) ).
cnf(4402,plain,
ld(X1,X1) = mult(ld(X1,unit),X1),
inference(spm,[status(thm)],[28,4132,theory(equality)]) ).
cnf(4463,plain,
unit = mult(ld(X1,unit),X1),
inference(rw,[status(thm)],[4402,32,theory(equality)]) ).
cnf(4558,negated_conjecture,
mult(esk1_0,ld(esk1_0,unit)) != unit,
inference(spm,[status(thm)],[24,4463,theory(equality)]) ).
cnf(4634,negated_conjecture,
$false,
inference(rw,[status(thm)],[4558,20,theory(equality)]) ).
cnf(4635,negated_conjecture,
$false,
inference(cn,[status(thm)],[4634,theory(equality)]) ).
cnf(4636,negated_conjecture,
$false,
4635,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP700+1.p
% --creating new selector for []
% -running prover on /tmp/tmpH6bDYZ/sel_GRP700+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP700+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP700+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP700+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
%
%------------------------------------------------------------------------------