%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR032+3 : 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:32 EST 2010
% Result : Theorem 55.50s
% Output : CNFRefutation 55.50s
% 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(217,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/tmp/tmp8MuJoK/sel_CSR032+3.p_5',ax2_496) ).
fof(345,axiom,
! [X6] :
( individual(X6)
=> isa(X6,c_individual) ),
file('/tmp/tmp8MuJoK/sel_CSR032+3.p_5',ax2_7971) ).
fof(513,conjecture,
? [X22] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X22) ),
file('/tmp/tmp8MuJoK/sel_CSR032+3.p_5',query132) ).
fof(514,negated_conjecture,
~ ? [X22] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X22) ),
inference(assume_negation,[status(cth)],[513]) ).
cnf(956,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[217]) ).
fof(1235,plain,
! [X6] :
( ~ individual(X6)
| isa(X6,c_individual) ),
inference(fof_nnf,[status(thm)],[345]) ).
fof(1236,plain,
! [X7] :
( ~ individual(X7)
| isa(X7,c_individual) ),
inference(variable_rename,[status(thm)],[1235]) ).
cnf(1237,plain,
( isa(X1,c_individual)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[1236]) ).
fof(1583,negated_conjecture,
! [X22] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X22) ),
inference(fof_nnf,[status(thm)],[514]) ).
fof(1584,negated_conjecture,
! [X23] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
& ~ isa(f_citynamedfn(s_agen,c_france),X23) ),
inference(variable_rename,[status(thm)],[1583]) ).
cnf(1585,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[1584]) ).
cnf(1659,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(spm,[status(thm)],[1237,956,theory(equality)]) ).
cnf(1660,plain,
$false,
inference(sr,[status(thm)],[1659,1585,theory(equality)]) ).
cnf(1661,plain,
$false,
1660,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR032+3.p
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmp8MuJoK/sel_CSR032+3.p_1 with time limit 29
% -prover status CounterSatisfiable
% -running prover on /tmp/tmp8MuJoK/sel_CSR032+3.p_2 with time limit 89
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmp8MuJoK/sel_CSR032+3.p_3 with time limit 119
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmp8MuJoK/sel_CSR032+3.p_4 with time limit 148
% -prover status CounterSatisfiable
% --creating new selector for [CSR002+2.ax]
% -running prover on /tmp/tmp8MuJoK/sel_CSR032+3.p_5 with time limit 242
% -prover status Theorem
% Problem CSR032+3.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR032+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR032+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
%
%------------------------------------------------------------------------------