TSTP Solution File: AGT001+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : AGT001+2 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 03:30:14 EST 2010
% Result : Theorem 0.63s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(70,axiom,
accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
file('/tmp/tmpxEch0X/sel_AGT001+2.p_1',event_27) ).
fof(350,conjecture,
accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
file('/tmp/tmpxEch0X/sel_AGT001+2.p_1',query_1) ).
fof(351,negated_conjecture,
~ accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
inference(assume_negation,[status(cth)],[350]) ).
fof(391,negated_conjecture,
~ accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
inference(fof_simplification,[status(thm)],[351,theory(equality)]) ).
cnf(461,plain,
accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
inference(split_conjunct,[status(thm)],[70]) ).
cnf(747,negated_conjecture,
~ accept_team(countryamedicalorganization,countryacivilorganization,towna,n6),
inference(split_conjunct,[status(thm)],[391]) ).
cnf(750,negated_conjecture,
$false,
inference(rw,[status(thm)],[747,461,theory(equality)]) ).
cnf(751,negated_conjecture,
$false,
inference(cn,[status(thm)],[750,theory(equality)]) ).
cnf(752,negated_conjecture,
$false,
751,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/AGT/AGT001+2.p
% --creating new selector for [NUM005+0.ax, AGT001+0.ax, AGT001+1.ax, AGT001+2.ax, NUM005+1.ax]
% -running prover on /tmp/tmpxEch0X/sel_AGT001+2.p_1 with time limit 29
% -prover status Theorem
% Problem AGT001+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/AGT/AGT001+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/AGT/AGT001+2.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
%
%------------------------------------------------------------------------------