TSTP Solution File: GRP702+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP702+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:41 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 54 ( 43 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 22 ~; 20 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 35 ( 0 sgn 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,conjecture,
! [X4,X5] :
( mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),X5) ),
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',goals) ).
fof(8,axiom,
! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',f02) ).
fof(11,axiom,
! [X2,X1] : mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',f10) ).
fof(12,axiom,
! [X1] : op_d = ld(X1,mult(op_c,X1)),
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',f11) ).
fof(13,axiom,
! [X2,X1] : mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',f09) ).
fof(14,axiom,
! [X2,X1] : mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
file('/tmp/tmpHbmZbJ/sel_GRP702+1.p_1',f08) ).
fof(15,negated_conjecture,
~ ! [X4,X5] :
( mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),X5) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(26,negated_conjecture,
? [X4,X5] :
( mult(op_d,mult(X4,X5)) != mult(mult(op_d,X4),X5)
| mult(X4,mult(X5,op_d)) != mult(mult(X4,X5),op_d)
| mult(X4,mult(op_d,X5)) != mult(mult(X4,op_d),X5) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(27,negated_conjecture,
? [X6,X7] :
( mult(op_d,mult(X6,X7)) != mult(mult(op_d,X6),X7)
| mult(X6,mult(X7,op_d)) != mult(mult(X6,X7),op_d)
| mult(X6,mult(op_d,X7)) != mult(mult(X6,op_d),X7) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_d)) != mult(mult(esk1_0,esk2_0),op_d)
| mult(esk1_0,mult(op_d,esk2_0)) != mult(mult(esk1_0,op_d),esk2_0) ),
inference(skolemize,[status(esa)],[27]) ).
cnf(29,negated_conjecture,
( mult(esk1_0,mult(op_d,esk2_0)) != mult(mult(esk1_0,op_d),esk2_0)
| mult(esk1_0,mult(esk2_0,op_d)) != mult(mult(esk1_0,esk2_0),op_d)
| mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(32,plain,
! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
inference(variable_rename,[status(thm)],[8]) ).
cnf(33,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[32]) ).
fof(38,plain,
! [X3,X4] : mult(X4,mult(op_c,X3)) = mult(mult(X4,op_c),X3),
inference(variable_rename,[status(thm)],[11]) ).
cnf(39,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[38]) ).
fof(40,plain,
! [X2] : op_d = ld(X2,mult(op_c,X2)),
inference(variable_rename,[status(thm)],[12]) ).
cnf(41,plain,
op_d = ld(X1,mult(op_c,X1)),
inference(split_conjunct,[status(thm)],[40]) ).
fof(42,plain,
! [X3,X4] : mult(X4,mult(X3,op_c)) = mult(mult(X4,X3),op_c),
inference(variable_rename,[status(thm)],[13]) ).
cnf(43,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[42]) ).
fof(44,plain,
! [X3,X4] : mult(op_c,mult(X4,X3)) = mult(mult(op_c,X4),X3),
inference(variable_rename,[status(thm)],[14]) ).
cnf(45,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(52,plain,
op_d = op_c,
inference(spm,[status(thm)],[33,41,theory(equality)]) ).
cnf(194,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(op_d,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_d),esk2_0) != mult(esk1_0,mult(op_d,esk2_0))
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[29,52,theory(equality)]),45,theory(equality)]) ).
cnf(195,negated_conjecture,
( $false
| mult(mult(esk1_0,op_d),esk2_0) != mult(esk1_0,mult(op_d,esk2_0))
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
inference(rw,[status(thm)],[194,52,theory(equality)]) ).
cnf(196,negated_conjecture,
( $false
| mult(esk1_0,mult(op_c,esk2_0)) != mult(esk1_0,mult(op_d,esk2_0))
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,52,theory(equality)]),39,theory(equality)]) ).
cnf(197,negated_conjecture,
( $false
| $false
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
inference(rw,[status(thm)],[196,52,theory(equality)]) ).
cnf(198,negated_conjecture,
( $false
| $false
| mult(esk1_0,mult(esk2_0,op_c)) != mult(esk1_0,mult(esk2_0,op_d)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[197,52,theory(equality)]),43,theory(equality)]) ).
cnf(199,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[198,52,theory(equality)]) ).
cnf(200,negated_conjecture,
$false,
inference(cn,[status(thm)],[199,theory(equality)]) ).
cnf(201,negated_conjecture,
$false,
200,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP702+1.p
% --creating new selector for []
% -running prover on /tmp/tmpHbmZbJ/sel_GRP702+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP702+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP702+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP702+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
%
%------------------------------------------------------------------------------