%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL009+2 : TPTP v5.0.0. Released v4.0.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 : Sun Dec 26 01:02:16 EST 2010
% Result : Theorem 110.55s
% Output : CNFRefutation 110.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 27 unt; 0 def)
% Number of atoms : 50 ( 46 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 7 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',converse_multiplicativity) ).
fof(2,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',converse_idempotence) ).
fof(3,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',converse_additivity) ).
fof(4,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',maddux1_join_commutativity) ).
fof(6,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',composition_distributivity) ).
fof(8,conjecture,
! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
file('/tmp/tmpu71pSM/sel_REL009+2.p_3',goals) ).
fof(9,negated_conjecture,
~ ! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
inference(assume_negation,[status(cth)],[8]) ).
fof(10,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(11,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(13,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[12]) ).
fof(14,plain,
! [X3,X4] : converse(join(X3,X4)) = join(converse(X3),converse(X4)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(15,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[14]) ).
fof(16,plain,
! [X3,X4] : join(X3,X4) = join(X4,X3),
inference(variable_rename,[status(thm)],[4]) ).
cnf(17,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[16]) ).
fof(20,plain,
! [X4,X5,X6] : composition(join(X4,X5),X6) = join(composition(X4,X6),composition(X5,X6)),
inference(variable_rename,[status(thm)],[6]) ).
cnf(21,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,negated_conjecture,
? [X1,X2,X3] :
( join(X1,X2) = X2
& ( join(composition(X1,X3),composition(X2,X3)) != composition(X2,X3)
| join(composition(X3,X1),composition(X3,X2)) != composition(X3,X2) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(25,negated_conjecture,
? [X4,X5,X6] :
( join(X4,X5) = X5
& ( join(composition(X4,X6),composition(X5,X6)) != composition(X5,X6)
| join(composition(X6,X4),composition(X6,X5)) != composition(X6,X5) ) ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& ( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[25]) ).
cnf(27,negated_conjecture,
( join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0)
| join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(28,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[26]) ).
cnf(29,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[28,17,theory(equality)]) ).
cnf(30,negated_conjecture,
( join(composition(esk2_0,esk3_0),composition(esk1_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[27,17,theory(equality)]) ).
cnf(31,negated_conjecture,
( join(composition(esk2_0,esk3_0),composition(esk1_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk2_0),composition(esk3_0,esk1_0)) != composition(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[30,17,theory(equality)]) ).
cnf(33,plain,
composition(converse(X1),X2) = converse(composition(converse(X2),X1)),
inference(spm,[status(thm)],[11,13,theory(equality)]) ).
cnf(55,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[21,11,theory(equality)]) ).
cnf(85,plain,
join(composition(converse(X2),X1),converse(X3)) = converse(join(composition(converse(X1),X2),X3)),
inference(spm,[status(thm)],[15,33,theory(equality)]) ).
cnf(155,negated_conjecture,
( $false
| join(composition(esk3_0,esk2_0),composition(esk3_0,esk1_0)) != composition(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[31,21,theory(equality)]),29,theory(equality)]) ).
cnf(156,negated_conjecture,
join(composition(esk3_0,esk2_0),composition(esk3_0,esk1_0)) != composition(esk3_0,esk2_0),
inference(cn,[status(thm)],[155,theory(equality)]) ).
cnf(1510,plain,
converse(composition(join(converse(X1),converse(X3)),converse(X2))) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(spm,[status(thm)],[85,55,theory(equality)]) ).
cnf(1561,plain,
composition(X2,join(X1,X3)) = join(composition(converse(converse(X2)),X1),converse(converse(composition(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1510,15,theory(equality)]),11,theory(equality)]),13,theory(equality)]) ).
cnf(1562,plain,
composition(X2,join(X1,X3)) = join(composition(X2,X1),composition(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1561,13,theory(equality)]),13,theory(equality)]) ).
cnf(1598,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[156,1562,theory(equality)]),29,theory(equality)]) ).
cnf(1599,negated_conjecture,
$false,
inference(cn,[status(thm)],[1598,theory(equality)]) ).
cnf(1600,negated_conjecture,
$false,
1599,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL009+2.p
% --creating new selector for [REL001+0.ax, REL001+1.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpu71pSM/sel_REL009+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpu71pSM/sel_REL009+2.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax, REL001+1.ax]
% -running prover on /tmp/tmpu71pSM/sel_REL009+2.p_3 with time limit 74
% -prover status Theorem
% Problem REL009+2.p solved in phase 2.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL009+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL009+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
%
%------------------------------------------------------------------------------