TSTP Solution File: CSR042+5 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR042+5 : TPTP v5.0.0. Bugfixed v3.5.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:17:11 EST 2010
% Result : Theorem 162.61s
% Output : CNFRefutation 169.93s
% 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(19,axiom,
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) ),
file('/tmp/tmpeHclHW/sel_CSR042+5.p_4',ax4_180596) ).
fof(58,axiom,
! [X4,X9] :
( borderson(X4,X9)
=> borderson(X9,X4) ),
file('/tmp/tmpeHclHW/sel_CSR042+5.p_4',ax4_540068) ).
fof(111,conjecture,
? [X1] :
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(X1,c_georegion_l4_x27_y64) ),
file('/tmp/tmpeHclHW/sel_CSR042+5.p_4',query242) ).
fof(112,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptpgeo_member7_mt)
=> borderson(X1,c_georegion_l4_x27_y64) ),
inference(assume_negation,[status(cth)],[111]) ).
fof(152,plain,
( ~ mtvisible(c_tptpgeo_member7_mt)
| borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) ),
inference(fof_nnf,[status(thm)],[19]) ).
cnf(153,plain,
( borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65)
| ~ mtvisible(c_tptpgeo_member7_mt) ),
inference(split_conjunct,[status(thm)],[152]) ).
fof(256,plain,
! [X4,X9] :
( ~ borderson(X4,X9)
| borderson(X9,X4) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(257,plain,
! [X10,X11] :
( ~ borderson(X10,X11)
| borderson(X11,X10) ),
inference(variable_rename,[status(thm)],[256]) ).
cnf(258,plain,
( borderson(X1,X2)
| ~ borderson(X2,X1) ),
inference(split_conjunct,[status(thm)],[257]) ).
fof(389,negated_conjecture,
! [X1] :
( mtvisible(c_tptpgeo_member7_mt)
& ~ borderson(X1,c_georegion_l4_x27_y64) ),
inference(fof_nnf,[status(thm)],[112]) ).
fof(390,negated_conjecture,
! [X2] :
( mtvisible(c_tptpgeo_member7_mt)
& ~ borderson(X2,c_georegion_l4_x27_y64) ),
inference(variable_rename,[status(thm)],[389]) ).
cnf(391,negated_conjecture,
~ borderson(X1,c_georegion_l4_x27_y64),
inference(split_conjunct,[status(thm)],[390]) ).
cnf(392,negated_conjecture,
mtvisible(c_tptpgeo_member7_mt),
inference(split_conjunct,[status(thm)],[390]) ).
cnf(393,plain,
( borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65)
| $false ),
inference(rw,[status(thm)],[153,392,theory(equality)]) ).
cnf(394,plain,
borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65),
inference(cn,[status(thm)],[393,theory(equality)]) ).
cnf(400,plain,
borderson(c_georegion_l4_x27_y65,c_georegion_l4_x27_y64),
inference(spm,[status(thm)],[258,394,theory(equality)]) ).
cnf(402,plain,
$false,
inference(sr,[status(thm)],[400,391,theory(equality)]) ).
cnf(403,plain,
$false,
402,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR042+5.p
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpeHclHW/sel_CSR042+5.p_1 with time limit 29
% -prover status CounterSatisfiable
% -running prover on /tmp/tmpeHclHW/sel_CSR042+5.p_2 with time limit 60
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpeHclHW/sel_CSR042+5.p_3 with time limit 81
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+4.ax]
% -running prover on /tmp/tmpeHclHW/sel_CSR042+5.p_4 with time limit 86
% -prover status Theorem
% Problem CSR042+5.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR042+5.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR042+5.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
%
%------------------------------------------------------------------------------