TSTP Solution File: GRP703+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP703+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:46 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 25 unt; 0 def)
% Number of atoms : 61 ( 50 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 : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : mult(X1,unit) = X1,
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f05) ).
fof(4,axiom,
! [X1] : mult(unit,X1) = X1,
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f06) ).
fof(6,conjecture,
! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),X5) ),
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',goals) ).
fof(7,axiom,
! [X2,X1] : mult(rd(X1,X2),X2) = X1,
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f03) ).
fof(9,axiom,
! [X2,X1] : op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f12) ).
fof(11,axiom,
! [X2,X1] : mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f10) ).
fof(13,axiom,
! [X2,X1] : mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f09) ).
fof(14,axiom,
! [X2,X1] : mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
file('/tmp/tmpgtDZ_y/sel_GRP703+1.p_1',f08) ).
fof(15,negated_conjecture,
~ ! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),X5) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(16,plain,
! [X2] : mult(X2,unit) = X2,
inference(variable_rename,[status(thm)],[1]) ).
cnf(17,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[16]) ).
fof(22,plain,
! [X2] : mult(unit,X2) = X2,
inference(variable_rename,[status(thm)],[4]) ).
cnf(23,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[22]) ).
fof(26,negated_conjecture,
? [X4,X5] :
( mult(op_e,mult(X4,X5)) != mult(mult(op_e,X4),X5)
| mult(X4,mult(X5,op_e)) != mult(mult(X4,X5),op_e)
| mult(X4,mult(op_e,X5)) != mult(mult(X4,op_e),X5) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(27,negated_conjecture,
? [X6,X7] :
( mult(op_e,mult(X6,X7)) != mult(mult(op_e,X6),X7)
| mult(X6,mult(X7,op_e)) != mult(mult(X6,X7),op_e)
| mult(X6,mult(op_e,X7)) != mult(mult(X6,op_e),X7) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_e)) != mult(mult(esk1_0,esk2_0),op_e)
| mult(esk1_0,mult(op_e,esk2_0)) != mult(mult(esk1_0,op_e),esk2_0) ),
inference(skolemize,[status(esa)],[27]) ).
cnf(29,negated_conjecture,
( mult(esk1_0,mult(op_e,esk2_0)) != mult(mult(esk1_0,op_e),esk2_0)
| mult(esk1_0,mult(esk2_0,op_e)) != mult(mult(esk1_0,esk2_0),op_e)
| mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X3,X4] : mult(rd(X4,X3),X3) = X4,
inference(variable_rename,[status(thm)],[7]) ).
cnf(31,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[30]) ).
fof(34,plain,
! [X3,X4] : op_e = mult(mult(rd(op_c,mult(X4,X3)),X3),X4),
inference(variable_rename,[status(thm)],[9]) ).
cnf(35,plain,
op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
inference(split_conjunct,[status(thm)],[34]) ).
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(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(96,plain,
op_e = mult(rd(op_c,mult(unit,X1)),X1),
inference(spm,[status(thm)],[17,35,theory(equality)]) ).
cnf(112,plain,
op_e = op_c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[96,23,theory(equality)]),31,theory(equality)]) ).
cnf(194,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(op_e,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_e),esk2_0) != mult(esk1_0,mult(op_e,esk2_0))
| mult(mult(esk1_0,esk2_0),op_e) != mult(esk1_0,mult(esk2_0,op_e)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[29,112,theory(equality)]),45,theory(equality)]) ).
cnf(195,negated_conjecture,
( $false
| mult(mult(esk1_0,op_e),esk2_0) != mult(esk1_0,mult(op_e,esk2_0))
| mult(mult(esk1_0,esk2_0),op_e) != mult(esk1_0,mult(esk2_0,op_e)) ),
inference(rw,[status(thm)],[194,112,theory(equality)]) ).
cnf(196,negated_conjecture,
( $false
| mult(esk1_0,mult(op_c,esk2_0)) != mult(esk1_0,mult(op_e,esk2_0))
| mult(mult(esk1_0,esk2_0),op_e) != mult(esk1_0,mult(esk2_0,op_e)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,112,theory(equality)]),39,theory(equality)]) ).
cnf(197,negated_conjecture,
( $false
| $false
| mult(mult(esk1_0,esk2_0),op_e) != mult(esk1_0,mult(esk2_0,op_e)) ),
inference(rw,[status(thm)],[196,112,theory(equality)]) ).
cnf(198,negated_conjecture,
( $false
| $false
| mult(esk1_0,mult(esk2_0,op_c)) != mult(esk1_0,mult(esk2_0,op_e)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[197,112,theory(equality)]),43,theory(equality)]) ).
cnf(199,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[198,112,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/GRP703+1.p
% --creating new selector for []
% -running prover on /tmp/tmpgtDZ_y/sel_GRP703+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP703+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP703+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP703+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
%
%------------------------------------------------------------------------------