%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SWV061+1 : TPTP v5.0.0. Bugfixed v3.3.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 : Sun Dec 26 12:00:26 EST 2010
% Result : Theorem 0.18s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 41 ( 16 ~; 6 |; 10 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(22,axiom,
true,
file('/tmp/tmpss7JDg/sel_SWV061+1.p_1',ttrue) ).
fof(33,conjecture,
( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
file('/tmp/tmpss7JDg/sel_SWV061+1.p_1',cl5_nebula_array_0002) ).
fof(58,negated_conjecture,
~ ( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
inference(assume_negation,[status(cth)],[33]) ).
fof(60,negated_conjecture,
~ ( true
=> ( ( ~ gt(loopcounter,n1)
=> true )
& ( gt(loopcounter,n1)
=> true ) ) ),
inference(fof_simplification,[status(thm)],[58,theory(equality)]) ).
cnf(110,plain,
true,
inference(split_conjunct,[status(thm)],[22]) ).
fof(125,negated_conjecture,
( true
& ( ( ~ gt(loopcounter,n1)
& ~ true )
| ( gt(loopcounter,n1)
& ~ true ) ) ),
inference(fof_nnf,[status(thm)],[60]) ).
fof(126,negated_conjecture,
( true
& ( gt(loopcounter,n1)
| ~ gt(loopcounter,n1) )
& ( ~ true
| ~ gt(loopcounter,n1) )
& ( gt(loopcounter,n1)
| ~ true )
& ( ~ true
| ~ true ) ),
inference(distribute,[status(thm)],[125]) ).
cnf(127,negated_conjecture,
( ~ true
| ~ true ),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(191,negated_conjecture,
$false,
inference(rw,[status(thm)],[127,110,theory(equality)]) ).
cnf(192,negated_conjecture,
$false,
inference(cn,[status(thm)],[191,theory(equality)]) ).
cnf(193,negated_conjecture,
$false,
192,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SWV/SWV061+1.p
% --creating new selector for [SWV003+0.ax]
% -running prover on /tmp/tmpss7JDg/sel_SWV061+1.p_1 with time limit 29
% -prover status Theorem
% Problem SWV061+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SWV/SWV061+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SWV/SWV061+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
%
%------------------------------------------------------------------------------