TSTP Solution File: GRP715+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP715+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:24:16 EST 2010
% Result : Theorem 7.70s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 36 unt; 0 def)
% Number of atoms : 50 ( 46 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 11 ~; 5 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X2,X3] : mult(X3,mult(X2,X2)) = mult(mult(X3,X2),X2),
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f07) ).
fof(4,axiom,
! [X1,X2,X3] : mult(mult(mult(X3,X2),X1),X2) = mult(X3,mult(mult(X2,X1),X2)),
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f06) ).
fof(6,conjecture,
! [X4] :
( mult(mult(X4,op_a),op_b) = X4
& mult(mult(X4,op_b),op_a) = X4 ),
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',goals) ).
fof(9,axiom,
mult(op_a,op_b) = unit,
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f10) ).
fof(10,axiom,
mult(op_b,op_a) = unit,
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f11) ).
fof(11,axiom,
! [X3] : mult(unit,X3) = X3,
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f09) ).
fof(12,axiom,
! [X3] : mult(X3,unit) = X3,
file('/tmp/tmpYkSKhm/sel_GRP715+1.p_1',f08) ).
fof(13,negated_conjecture,
~ ! [X4] :
( mult(mult(X4,op_a),op_b) = X4
& mult(mult(X4,op_b),op_a) = X4 ),
inference(assume_negation,[status(cth)],[6]) ).
fof(18,plain,
! [X4,X5] : mult(X5,mult(X4,X4)) = mult(mult(X5,X4),X4),
inference(variable_rename,[status(thm)],[3]) ).
cnf(19,plain,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
inference(split_conjunct,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5,X6] : mult(mult(mult(X6,X5),X4),X5) = mult(X6,mult(mult(X5,X4),X5)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(21,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,negated_conjecture,
? [X4] :
( mult(mult(X4,op_a),op_b) != X4
| mult(mult(X4,op_b),op_a) != X4 ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(25,negated_conjecture,
? [X5] :
( mult(mult(X5,op_a),op_b) != X5
| mult(mult(X5,op_b),op_a) != X5 ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,negated_conjecture,
( mult(mult(esk1_0,op_a),op_b) != esk1_0
| mult(mult(esk1_0,op_b),op_a) != esk1_0 ),
inference(skolemize,[status(esa)],[25]) ).
cnf(27,negated_conjecture,
( mult(mult(esk1_0,op_b),op_a) != esk1_0
| mult(mult(esk1_0,op_a),op_b) != esk1_0 ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(32,plain,
mult(op_a,op_b) = unit,
inference(split_conjunct,[status(thm)],[9]) ).
cnf(33,plain,
mult(op_b,op_a) = unit,
inference(split_conjunct,[status(thm)],[10]) ).
fof(34,plain,
! [X4] : mult(unit,X4) = X4,
inference(variable_rename,[status(thm)],[11]) ).
cnf(35,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,plain,
! [X4] : mult(X4,unit) = X4,
inference(variable_rename,[status(thm)],[12]) ).
cnf(37,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[36]) ).
cnf(54,plain,
mult(unit,op_b) = mult(op_a,mult(op_b,op_b)),
inference(spm,[status(thm)],[19,32,theory(equality)]) ).
cnf(55,plain,
mult(unit,op_a) = mult(op_b,mult(op_a,op_a)),
inference(spm,[status(thm)],[19,33,theory(equality)]) ).
cnf(60,plain,
op_b = mult(op_a,mult(op_b,op_b)),
inference(rw,[status(thm)],[54,35,theory(equality)]) ).
cnf(61,plain,
op_a = mult(op_b,mult(op_a,op_a)),
inference(rw,[status(thm)],[55,35,theory(equality)]) ).
cnf(95,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(mult(X1,X2),X3),mult(X2,X2)),
inference(spm,[status(thm)],[19,21,theory(equality)]) ).
cnf(97,plain,
mult(mult(mult(X1,mult(X2,X2)),X3),X2) = mult(mult(X1,X2),mult(mult(X2,X3),X2)),
inference(spm,[status(thm)],[21,19,theory(equality)]) ).
cnf(2611,plain,
mult(mult(X1,mult(unit,op_a)),op_a) = mult(mult(mult(X1,op_a),op_b),mult(op_a,op_a)),
inference(spm,[status(thm)],[95,32,theory(equality)]) ).
cnf(2698,plain,
mult(X1,mult(op_a,op_a)) = mult(mult(mult(X1,op_a),op_b),mult(op_a,op_a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[2611,35,theory(equality)]),19,theory(equality)]) ).
cnf(158287,plain,
mult(mult(X1,mult(op_a,op_a)),op_b) = mult(mult(X1,op_a),mult(mult(op_b,mult(op_a,op_a)),op_b)),
inference(spm,[status(thm)],[21,2698,theory(equality)]) ).
cnf(158403,plain,
mult(mult(X1,mult(op_a,op_a)),op_b) = mult(X1,op_a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[158287,61,theory(equality)]),32,theory(equality)]),37,theory(equality)]) ).
cnf(158510,plain,
mult(mult(X1,op_b),op_a) = mult(X1,mult(mult(op_b,mult(op_a,op_a)),op_b)),
inference(spm,[status(thm)],[21,158403,theory(equality)]) ).
cnf(158529,plain,
mult(mult(X1,mult(op_b,op_b)),op_a) = mult(mult(X1,op_b),mult(mult(op_b,mult(op_a,op_a)),op_b)),
inference(spm,[status(thm)],[97,158403,theory(equality)]) ).
cnf(158604,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[158510,61,theory(equality)]),32,theory(equality)]),37,theory(equality)]) ).
cnf(158623,plain,
mult(mult(X1,mult(op_b,op_b)),op_a) = mult(X1,op_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[158529,61,theory(equality)]),32,theory(equality)]),37,theory(equality)]) ).
cnf(158840,negated_conjecture,
( mult(mult(esk1_0,op_a),op_b) != esk1_0
| $false ),
inference(rw,[status(thm)],[27,158604,theory(equality)]) ).
cnf(158841,negated_conjecture,
mult(mult(esk1_0,op_a),op_b) != esk1_0,
inference(cn,[status(thm)],[158840,theory(equality)]) ).
cnf(159160,plain,
mult(mult(X1,op_a),op_b) = mult(X1,mult(mult(op_a,mult(op_b,op_b)),op_a)),
inference(spm,[status(thm)],[21,158623,theory(equality)]) ).
cnf(159254,plain,
mult(mult(X1,op_a),op_b) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[159160,60,theory(equality)]),33,theory(equality)]),37,theory(equality)]) ).
cnf(160284,negated_conjecture,
$false,
inference(rw,[status(thm)],[158841,159254,theory(equality)]) ).
cnf(160285,negated_conjecture,
$false,
inference(cn,[status(thm)],[160284,theory(equality)]) ).
cnf(160286,negated_conjecture,
$false,
160285,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP715+1.p
% --creating new selector for []
% -running prover on /tmp/tmpYkSKhm/sel_GRP715+1.p_1 with time limit 29
% -prover status Theorem
% Problem GRP715+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP715+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP715+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
%
%------------------------------------------------------------------------------