%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR042+3 : TPTP v5.0.0. Released v3.4.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 : Sat Dec 25 06:16:49 EST 2010
% Result : Theorem 2.25s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 13 ( 1 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) ),
file('/tmp/tmpovpxRE/sel_CSR042+3.p_4',ax2_2459) ).
fof(20,axiom,
! [X5,X6] :
( borderson(X5,X6)
=> borderson(X6,X5) ),
file('/tmp/tmpovpxRE/sel_CSR042+3.p_4',ax2_7642) ).
fof(54,conjecture,
? [X1] :
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(X1,c_georegion_l4_x27_y64) ),
file('/tmp/tmpovpxRE/sel_CSR042+3.p_4',query142) ).
fof(55,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(X1,c_georegion_l4_x27_y64) ),
inference(assume_negation,[status(cth)],[54]) ).
fof(72,plain,
( ~ mtvisible(c_tptpgeo_member7_mt)
| borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) ),
inference(fof_nnf,[status(thm)],[7]) ).
cnf(73,plain,
( borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
inference(split_conjunct,[status(thm)],[72]) ).
fof(105,plain,
! [X5,X6] :
( ~ borderson(X5,X6)
| borderson(X6,X5) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(106,plain,
! [X7,X8] :
( ~ borderson(X7,X8)
| borderson(X8,X7) ),
inference(variable_rename,[status(thm)],[105]) ).
cnf(107,plain,
( borderson(X1,X2)
| ~ borderson(X2,X1) ),
inference(split_conjunct,[status(thm)],[106]) ).
fof(191,negated_conjecture,
! [X1] :
( mtvisible(c_tptpgeo_member7_mt)
& ~ borderson(X1,c_georegion_l4_x27_y64) ),
inference(fof_nnf,[status(thm)],[55]) ).
fof(192,negated_conjecture,
! [X2] :
( mtvisible(c_tptpgeo_member7_mt)
& ~ borderson(X2,c_georegion_l4_x27_y64) ),
inference(variable_rename,[status(thm)],[191]) ).
cnf(193,negated_conjecture,
~ borderson(X1,c_georegion_l4_x27_y64),
inference(split_conjunct,[status(thm)],[192]) ).
cnf(194,negated_conjecture,
mtvisible(c_tptpgeo_member7_mt),
inference(split_conjunct,[status(thm)],[192]) ).
cnf(195,plain,
( borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65)
| $false ),
inference(rw,[status(thm)],[73,194,theory(equality)]) ).
cnf(196,plain,
borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65),
inference(cn,[status(thm)],[195,theory(equality)]) ).
cnf(201,plain,
borderson(c_georegion_l4_x27_y65,c_georegion_l4_x27_y64),
inference(spm,[status(thm)],[107,196,theory(equality)]) ).
cnf(202,plain,
$false,
inference(sr,[status(thm)],[201,193,theory(equality)]) ).
cnf(203,plain,
$false,
202,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR042+3.p
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmpovpxRE/sel_CSR042+3.p_1 with time limit 29
% -prover status CounterSatisfiable
% -running prover on /tmp/tmpovpxRE/sel_CSR042+3.p_2 with time limit 89
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmpovpxRE/sel_CSR042+3.p_3 with time limit 119
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmpovpxRE/sel_CSR042+3.p_4 with time limit 149
% -prover status Theorem
% Problem CSR042+3.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR042+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR042+3.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
%
%------------------------------------------------------------------------------