%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : REL014+1 : 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:04:28 EST 2010
% Result : Theorem 185.59s
% Output : CNFRefutation 185.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 18 unt; 0 def)
% Number of atoms : 32 ( 28 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 : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/tmp/tmpYXyQg5/sel_REL014+1.p_4',converse_multiplicativity) ).
fof(2,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/tmp/tmpYXyQg5/sel_REL014+1.p_4',converse_idempotence) ).
fof(7,axiom,
! [X1] : composition(X1,one) = X1,
file('/tmp/tmpYXyQg5/sel_REL014+1.p_4',composition_identity) ).
fof(11,conjecture,
! [X1] :
( composition(X1,one) = X1
& composition(one,X1) = X1 ),
file('/tmp/tmpYXyQg5/sel_REL014+1.p_4',goals) ).
fof(12,negated_conjecture,
~ ! [X1] :
( composition(X1,one) = X1
& composition(one,X1) = X1 ),
inference(assume_negation,[status(cth)],[11]) ).
fof(13,plain,
! [X3,X4] : converse(composition(X3,X4)) = composition(converse(X4),converse(X3)),
inference(variable_rename,[status(thm)],[1]) ).
cnf(14,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X2] : converse(converse(X2)) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(16,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[15]) ).
fof(25,plain,
! [X2] : composition(X2,one) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(26,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[25]) ).
fof(33,negated_conjecture,
? [X1] :
( composition(X1,one) != X1
| composition(one,X1) != X1 ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(34,negated_conjecture,
? [X2] :
( composition(X2,one) != X2
| composition(one,X2) != X2 ),
inference(variable_rename,[status(thm)],[33]) ).
fof(35,negated_conjecture,
( composition(esk1_0,one) != esk1_0
| composition(one,esk1_0) != esk1_0 ),
inference(skolemize,[status(esa)],[34]) ).
cnf(36,negated_conjecture,
( composition(one,esk1_0) != esk1_0
| composition(esk1_0,one) != esk1_0 ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(37,negated_conjecture,
( composition(one,esk1_0) != esk1_0
| $false ),
inference(rw,[status(thm)],[36,26,theory(equality)]) ).
cnf(38,negated_conjecture,
composition(one,esk1_0) != esk1_0,
inference(cn,[status(thm)],[37,theory(equality)]) ).
cnf(40,plain,
composition(converse(X1),X2) = converse(composition(converse(X2),X1)),
inference(spm,[status(thm)],[14,16,theory(equality)]) ).
cnf(129,plain,
converse(converse(X1)) = composition(converse(one),X1),
inference(spm,[status(thm)],[40,26,theory(equality)]) ).
cnf(143,plain,
X1 = composition(converse(one),X1),
inference(rw,[status(thm)],[129,16,theory(equality)]) ).
cnf(155,plain,
one = converse(one),
inference(spm,[status(thm)],[26,143,theory(equality)]) ).
cnf(181,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[143,155,theory(equality)]) ).
cnf(217,negated_conjecture,
$false,
inference(rw,[status(thm)],[38,181,theory(equality)]) ).
cnf(218,negated_conjecture,
$false,
inference(cn,[status(thm)],[217,theory(equality)]) ).
cnf(219,negated_conjecture,
$false,
218,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/REL/REL014+1.p
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpYXyQg5/sel_REL014+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpYXyQg5/sel_REL014+1.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpYXyQg5/sel_REL014+1.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [REL001+0.ax]
% -running prover on /tmp/tmpYXyQg5/sel_REL014+1.p_4 with time limit 55
% -prover status Theorem
% Problem REL014+1.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/REL/REL014+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/REL/REL014+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
%
%------------------------------------------------------------------------------