%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR025+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 06:00:58 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( mtvisible(c_patterndetectormt)
=> genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
file('/tmp/tmpSA29Zh/sel_CSR025+1.p_1',query25) ).
fof(28,axiom,
genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
file('/tmp/tmpSA29Zh/sel_CSR025+1.p_1',just4) ).
fof(55,negated_conjecture,
~ ( mtvisible(c_patterndetectormt)
=> genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(56,negated_conjecture,
( mtvisible(c_patterndetectormt)
& ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931) ),
inference(fof_nnf,[status(thm)],[55]) ).
cnf(57,negated_conjecture,
~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(129,plain,
genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(206,negated_conjecture,
$false,
inference(rw,[status(thm)],[57,129,theory(equality)]) ).
cnf(207,negated_conjecture,
$false,
inference(cn,[status(thm)],[206,theory(equality)]) ).
cnf(208,negated_conjecture,
$false,
207,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR025+1.p
% --creating new selector for [CSR002+0.ax]
% -running prover on /tmp/tmpSA29Zh/sel_CSR025+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR025+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR025+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR025+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
%
%------------------------------------------------------------------------------