%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN079+1 : TPTP v5.0.0. Released v2.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 : Sun Dec 26 13:13:01 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 7 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
big_f(f(a,b),f(b,c)),
file('/tmp/tmpH5E1SH/sel_SYN079+1.p_1',pel57_1) ).
fof(2,conjecture,
big_f(f(a,b),f(a,c)),
file('/tmp/tmpH5E1SH/sel_SYN079+1.p_1',pel57) ).
fof(3,axiom,
! [X1,X2,X3] :
( ( big_f(X1,X2)
& big_f(X2,X3) )
=> big_f(X1,X3) ),
file('/tmp/tmpH5E1SH/sel_SYN079+1.p_1',pel57_3) ).
fof(4,axiom,
big_f(f(b,c),f(a,c)),
file('/tmp/tmpH5E1SH/sel_SYN079+1.p_1',pel57_2) ).
fof(5,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
inference(assume_negation,[status(cth)],[2]) ).
fof(6,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
cnf(7,plain,
big_f(f(a,b),f(b,c)),
inference(split_conjunct,[status(thm)],[1]) ).
cnf(8,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
inference(split_conjunct,[status(thm)],[6]) ).
fof(9,plain,
! [X1,X2,X3] :
( ~ big_f(X1,X2)
| ~ big_f(X2,X3)
| big_f(X1,X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(10,plain,
! [X4,X5,X6] :
( ~ big_f(X4,X5)
| ~ big_f(X5,X6)
| big_f(X4,X6) ),
inference(variable_rename,[status(thm)],[9]) ).
cnf(11,plain,
( big_f(X1,X2)
| ~ big_f(X3,X2)
| ~ big_f(X1,X3) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
big_f(f(b,c),f(a,c)),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(14,plain,
( big_f(X1,f(a,c))
| ~ big_f(X1,f(b,c)) ),
inference(spm,[status(thm)],[11,12,theory(equality)]) ).
cnf(15,plain,
big_f(f(a,b),f(a,c)),
inference(spm,[status(thm)],[14,7,theory(equality)]) ).
cnf(16,plain,
$false,
inference(sr,[status(thm)],[15,8,theory(equality)]) ).
cnf(17,plain,
$false,
16,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN079+1.p
% --creating new selector for []
% -running prover on /tmp/tmpH5E1SH/sel_SYN079+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN079+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN079+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN079+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
%
%------------------------------------------------------------------------------