TSTP Solution File: CSR032+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR032+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:06:10 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 1 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( individual(X1)
=> isa(X1,c_individual) ),
file('/tmp/tmpLAVIos/sel_CSR032+1.p_1',just57) ).
fof(29,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/tmp/tmpLAVIos/sel_CSR032+1.p_1',just1) ).
fof(36,conjecture,
? [X10] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X10) ),
file('/tmp/tmpLAVIos/sel_CSR032+1.p_1',query32) ).
fof(69,negated_conjecture,
~ ? [X10] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X10) ),
inference(assume_negation,[status(cth)],[36]) ).
fof(70,plain,
! [X1] :
( ~ individual(X1)
| isa(X1,c_individual) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(71,plain,
! [X2] :
( ~ individual(X2)
| isa(X2,c_individual) ),
inference(variable_rename,[status(thm)],[70]) ).
cnf(72,plain,
( isa(X1,c_individual)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(151,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[29]) ).
fof(160,negated_conjecture,
! [X10] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X10) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(161,negated_conjecture,
! [X11] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X11) ),
inference(variable_rename,[status(thm)],[160]) ).
cnf(162,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[161]) ).
cnf(251,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(spm,[status(thm)],[72,151,theory(equality)]) ).
cnf(252,plain,
$false,
inference(sr,[status(thm)],[251,162,theory(equality)]) ).
cnf(253,plain,
$false,
252,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR032+1.p
% --creating new selector for [CSR002+0.ax]
% -running prover on /tmp/tmpLAVIos/sel_CSR032+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR032+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR032+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR032+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
%
%------------------------------------------------------------------------------