%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : COM007+2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 05:44:36 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 104 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 104 ( 47 ~; 44 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( ( reflexive_rewrite(b,X1)
& reflexive_rewrite(c,X1) )
=> goal ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',goal_ax) ).
fof(2,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( X1 = X2
| rewrite(X1,X2) ) ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',equal_or_rewrite) ).
fof(3,axiom,
! [X1,X2] :
( X1 = X2
=> reflexive_rewrite(X1,X2) ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',equal_in_reflexive_rewrite) ).
fof(4,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',rewrite_in_reflexive_rewrite) ).
fof(5,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',assumption) ).
fof(6,conjecture,
goal,
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',goal_to_be_proved) ).
fof(7,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( rewrite(X2,X4)
& rewrite(X3,X4) ) ),
file('/tmp/tmp-hWDMD/sel_COM007+2.p_1',rewrite_diamond) ).
fof(8,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[6]) ).
fof(9,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(10,plain,
! [X1] :
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1)
| goal ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(11,plain,
! [X2] :
( ~ reflexive_rewrite(b,X2)
| ~ reflexive_rewrite(c,X2)
| goal ),
inference(variable_rename,[status(thm)],[10]) ).
cnf(12,plain,
( goal
| ~ reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(split_conjunct,[status(thm)],[11]) ).
fof(13,plain,
! [X1,X2] :
( ~ reflexive_rewrite(X1,X2)
| X1 = X2
| rewrite(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(14,plain,
! [X3,X4] :
( ~ reflexive_rewrite(X3,X4)
| X3 = X4
| rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[13]) ).
cnf(15,plain,
( rewrite(X1,X2)
| X1 = X2
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X1,X2] :
( X1 != X2
| reflexive_rewrite(X1,X2) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(17,plain,
! [X3,X4] :
( X3 != X4
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[16]) ).
cnf(18,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X1,X2] :
( ~ rewrite(X1,X2)
| reflexive_rewrite(X1,X2) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(20,plain,
! [X3,X4] :
( ~ rewrite(X3,X4)
| reflexive_rewrite(X3,X4) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(23,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(24,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[9]) ).
fof(25,plain,
! [X1,X2,X3] :
( ~ rewrite(X1,X2)
| ~ rewrite(X1,X3)
| ? [X4] :
( rewrite(X2,X4)
& rewrite(X3,X4) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(26,plain,
! [X5,X6,X7] :
( ~ rewrite(X5,X6)
| ~ rewrite(X5,X7)
| ? [X8] :
( rewrite(X6,X8)
& rewrite(X7,X8) ) ),
inference(variable_rename,[status(thm)],[25]) ).
fof(27,plain,
! [X5,X6,X7] :
( ~ rewrite(X5,X6)
| ~ rewrite(X5,X7)
| ( rewrite(X6,esk1_3(X5,X6,X7))
& rewrite(X7,esk1_3(X5,X6,X7)) ) ),
inference(skolemize,[status(esa)],[26]) ).
fof(28,plain,
! [X5,X6,X7] :
( ( rewrite(X6,esk1_3(X5,X6,X7))
| ~ rewrite(X5,X6)
| ~ rewrite(X5,X7) )
& ( rewrite(X7,esk1_3(X5,X6,X7))
| ~ rewrite(X5,X6)
| ~ rewrite(X5,X7) ) ),
inference(distribute,[status(thm)],[27]) ).
cnf(29,plain,
( rewrite(X2,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( rewrite(X3,esk1_3(X1,X3,X2))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(31,plain,
reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[18,theory(equality)]) ).
cnf(32,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[12,24,theory(equality)]) ).
cnf(33,plain,
( ~ reflexive_rewrite(b,X1)
| ~ rewrite(c,X1) ),
inference(spm,[status(thm)],[32,21,theory(equality)]) ).
cnf(34,plain,
( a = b
| rewrite(a,b) ),
inference(spm,[status(thm)],[15,23,theory(equality)]) ).
cnf(35,plain,
( a = c
| rewrite(a,c) ),
inference(spm,[status(thm)],[15,22,theory(equality)]) ).
cnf(37,plain,
( ~ rewrite(c,X1)
| ~ rewrite(b,X1) ),
inference(spm,[status(thm)],[33,21,theory(equality)]) ).
cnf(38,plain,
( ~ rewrite(b,esk1_3(X1,c,X2))
| ~ rewrite(X1,c)
| ~ rewrite(X1,X2) ),
inference(spm,[status(thm)],[37,30,theory(equality)]) ).
cnf(40,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[38,29,theory(equality)]) ).
cnf(41,plain,
( c = a
| ~ rewrite(a,b) ),
inference(spm,[status(thm)],[40,35,theory(equality)]) ).
cnf(42,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[32,31,theory(equality)]) ).
cnf(43,plain,
~ rewrite(c,b),
inference(spm,[status(thm)],[33,31,theory(equality)]) ).
cnf(46,plain,
( c = a
| a = b ),
inference(spm,[status(thm)],[41,34,theory(equality)]) ).
cnf(49,plain,
( a = b
| ~ rewrite(a,b) ),
inference(spm,[status(thm)],[43,46,theory(equality)]) ).
cnf(58,plain,
a = b,
inference(csr,[status(thm)],[49,34]) ).
cnf(59,plain,
reflexive_rewrite(b,c),
inference(rw,[status(thm)],[22,58,theory(equality)]) ).
cnf(60,plain,
$false,
inference(sr,[status(thm)],[59,42,theory(equality)]) ).
cnf(61,plain,
$false,
60,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/COM/COM007+2.p
% --creating new selector for []
% -running prover on /tmp/tmp-hWDMD/sel_COM007+2.p_1 with time limit 29
% -prover status Theorem
% Problem COM007+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/COM/COM007+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/COM/COM007+2.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
%
%------------------------------------------------------------------------------