TSTP Solution File: GRP012+5 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GRP012+5 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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 10:03:57 EST 2010
% Result : Theorem 0.39s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 13 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 162 ( 52 ~; 44 |; 58 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 174 ( 0 sgn 118 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
file('/tmp/tmps_KX7U/sel_GRP012+5.p_1',prove_distribution) ).
fof(2,negated_conjecture,
~ ! [X1] :
( ( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X5,X4,X7) )
=> product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ( product(X2,X3,X5)
& product(X3,X4,X6)
& product(X2,X6,X7) )
=> product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1) )
=> ! [X5,X6,X7,X2] :
( ( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2) )
=> product(inverse(X7),inverse(X2),X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1] :
( ! [X2,X3] :
? [X4] : product(X2,X3,X4)
& ! [X2,X3,X4,X5,X6,X7] :
( ~ product(X2,X3,X5)
| ~ product(X3,X4,X6)
| ~ product(X5,X4,X7)
| product(X2,X6,X7) )
& ! [X2,X3,X4,X5,X6,X7] :
( ~ product(X2,X3,X5)
| ~ product(X3,X4,X6)
| ~ product(X2,X6,X7)
| product(X5,X4,X7) )
& ! [X2] : product(X2,X1,X2)
& ! [X2] : product(X1,X2,X2)
& ! [X2] : product(X2,inverse(X2),X1)
& ! [X2] : product(inverse(X2),X2,X1)
& ? [X5,X6,X7,X2] :
( product(inverse(X5),inverse(X6),X7)
& product(X6,X5,X2)
& ~ product(inverse(X7),inverse(X2),X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X8] :
( ! [X9,X10] :
? [X11] : product(X9,X10,X11)
& ! [X12,X13,X14,X15,X16,X17] :
( ~ product(X12,X13,X15)
| ~ product(X13,X14,X16)
| ~ product(X15,X14,X17)
| product(X12,X16,X17) )
& ! [X18,X19,X20,X21,X22,X23] :
( ~ product(X18,X19,X21)
| ~ product(X19,X20,X22)
| ~ product(X18,X22,X23)
| product(X21,X20,X23) )
& ! [X24] : product(X24,X8,X24)
& ! [X25] : product(X8,X25,X25)
& ! [X26] : product(X26,inverse(X26),X8)
& ! [X27] : product(inverse(X27),X27,X8)
& ? [X28,X29,X30,X31] :
( product(inverse(X28),inverse(X29),X30)
& product(X29,X28,X31)
& ~ product(inverse(X30),inverse(X31),X8) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X9,X10] : product(X9,X10,esk2_2(X9,X10))
& ! [X12,X13,X14,X15,X16,X17] :
( ~ product(X12,X13,X15)
| ~ product(X13,X14,X16)
| ~ product(X15,X14,X17)
| product(X12,X16,X17) )
& ! [X18,X19,X20,X21,X22,X23] :
( ~ product(X18,X19,X21)
| ~ product(X19,X20,X22)
| ~ product(X18,X22,X23)
| product(X21,X20,X23) )
& ! [X24] : product(X24,esk1_0,X24)
& ! [X25] : product(esk1_0,X25,X25)
& ! [X26] : product(X26,inverse(X26),esk1_0)
& ! [X27] : product(inverse(X27),X27,esk1_0)
& product(inverse(esk3_0),inverse(esk4_0),esk5_0)
& product(esk4_0,esk3_0,esk6_0)
& ~ product(inverse(esk5_0),inverse(esk6_0),esk1_0) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X9,X10,X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27] :
( product(inverse(X27),X27,esk1_0)
& product(X26,inverse(X26),esk1_0)
& product(esk1_0,X25,X25)
& product(X24,esk1_0,X24)
& ( ~ product(X18,X19,X21)
| ~ product(X19,X20,X22)
| ~ product(X18,X22,X23)
| product(X21,X20,X23) )
& ( ~ product(X12,X13,X15)
| ~ product(X13,X14,X16)
| ~ product(X15,X14,X17)
| product(X12,X16,X17) )
& product(X9,X10,esk2_2(X9,X10))
& product(inverse(esk3_0),inverse(esk4_0),esk5_0)
& product(esk4_0,esk3_0,esk6_0)
& ~ product(inverse(esk5_0),inverse(esk6_0),esk1_0) ),
inference(shift_quantors,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X2,X5)
| ~ product(X4,X6,X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(13,negated_conjecture,
product(X1,esk1_0,X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(14,negated_conjecture,
product(esk1_0,X1,X1),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(15,negated_conjecture,
product(X1,inverse(X1),esk1_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(16,negated_conjecture,
product(inverse(X1),X1,esk1_0),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(20,negated_conjecture,
( product(X1,esk5_0,X2)
| ~ product(X3,inverse(esk4_0),X2)
| ~ product(X1,inverse(esk3_0),X3) ),
inference(spm,[status(thm)],[11,9,theory(equality)]) ).
cnf(21,negated_conjecture,
( product(X1,esk1_0,X2)
| ~ product(X4,inverse(X3),X2)
| ~ product(X1,X3,X4) ),
inference(spm,[status(thm)],[11,15,theory(equality)]) ).
cnf(28,negated_conjecture,
( product(X1,inverse(X2),X3)
| ~ product(X4,X2,X1)
| ~ product(X4,esk1_0,X3) ),
inference(spm,[status(thm)],[12,15,theory(equality)]) ).
cnf(29,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,inverse(X2),X1)
| ~ product(X4,esk1_0,X3) ),
inference(spm,[status(thm)],[12,16,theory(equality)]) ).
cnf(120,negated_conjecture,
( product(X1,esk5_0,esk1_0)
| ~ product(X1,inverse(esk3_0),esk4_0) ),
inference(spm,[status(thm)],[20,15,theory(equality)]) ).
cnf(149,negated_conjecture,
( product(X1,esk1_0,inverse(X2))
| ~ product(X1,X2,esk1_0) ),
inference(spm,[status(thm)],[21,14,theory(equality)]) ).
cnf(478,negated_conjecture,
( product(X1,inverse(X2),X3)
| ~ product(X3,X2,X1) ),
inference(spm,[status(thm)],[28,13,theory(equality)]) ).
cnf(572,negated_conjecture,
( product(esk1_0,X1,X2)
| ~ product(X1,esk1_0,X2) ),
inference(spm,[status(thm)],[29,15,theory(equality)]) ).
cnf(609,negated_conjecture,
( product(esk1_0,X1,inverse(X2))
| ~ product(X1,X2,esk1_0) ),
inference(spm,[status(thm)],[572,149,theory(equality)]) ).
cnf(906,negated_conjecture,
~ product(esk1_0,esk6_0,inverse(esk5_0)),
inference(spm,[status(thm)],[7,478,theory(equality)]) ).
cnf(911,negated_conjecture,
( product(X1,esk5_0,esk1_0)
| ~ product(esk4_0,esk3_0,X1) ),
inference(spm,[status(thm)],[120,478,theory(equality)]) ).
cnf(973,negated_conjecture,
product(esk6_0,esk5_0,esk1_0),
inference(spm,[status(thm)],[911,8,theory(equality)]) ).
cnf(3214,negated_conjecture,
~ product(esk6_0,esk5_0,esk1_0),
inference(spm,[status(thm)],[906,609,theory(equality)]) ).
cnf(3276,negated_conjecture,
$false,
inference(rw,[status(thm)],[3214,973,theory(equality)]) ).
cnf(3277,negated_conjecture,
$false,
inference(cn,[status(thm)],[3276,theory(equality)]) ).
cnf(3278,negated_conjecture,
$false,
3277,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/GRP/GRP012+5.p
% --creating new selector for []
% -running prover on /tmp/tmps_KX7U/sel_GRP012+5.p_1 with time limit 29
% -prover status Theorem
% Problem GRP012+5.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/GRP/GRP012+5.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/GRP/GRP012+5.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
%
%------------------------------------------------------------------------------