TSTP Solution File: AGT003+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : AGT003+2 : TPTP v5.0.0. Bugfixed v3.1.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 03:30:35 EST 2010
% Result : Theorem 0.35s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 14 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 56 ( 24 ~; 20 |; 11 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(144,axiom,
! [X1,X2,X3,X4] :
( accept_team(X1,X4,X2,X3)
<=> ( accept_city(X1,X2)
& accept_leader(X1,X4)
& accept_number(X1,X3) ) ),
file('/tmp/tmpw1N8Ub/sel_AGT003+2.p_1',a1_1) ).
fof(152,axiom,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
file('/tmp/tmpw1N8Ub/sel_AGT003+2.p_1',deduced_84) ).
fof(219,axiom,
accept_city(christiansufferterrahumanitarianorganization,towna),
file('/tmp/tmpw1N8Ub/sel_AGT003+2.p_1',deduced_83) ).
fof(356,axiom,
accept_number(christiansufferterrahumanitarianorganization,n5),
file('/tmp/tmpw1N8Ub/sel_AGT003+2.p_1',deduced_164) ).
fof(379,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/tmp/tmpw1N8Ub/sel_AGT003+2.p_1',query_3) ).
fof(380,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(assume_negation,[status(cth)],[379]) ).
fof(424,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_simplification,[status(thm)],[380,theory(equality)]) ).
fof(568,plain,
! [X1,X2,X3,X4] :
( ( ~ accept_team(X1,X4,X2,X3)
| ( accept_city(X1,X2)
& accept_leader(X1,X4)
& accept_number(X1,X3) ) )
& ( ~ accept_city(X1,X2)
| ~ accept_leader(X1,X4)
| ~ accept_number(X1,X3)
| accept_team(X1,X4,X2,X3) ) ),
inference(fof_nnf,[status(thm)],[144]) ).
fof(569,plain,
! [X5,X6,X7,X8] :
( ( ~ accept_team(X5,X8,X6,X7)
| ( accept_city(X5,X6)
& accept_leader(X5,X8)
& accept_number(X5,X7) ) )
& ( ~ accept_city(X5,X6)
| ~ accept_leader(X5,X8)
| ~ accept_number(X5,X7)
| accept_team(X5,X8,X6,X7) ) ),
inference(variable_rename,[status(thm)],[568]) ).
fof(570,plain,
! [X5,X6,X7,X8] :
( ( accept_city(X5,X6)
| ~ accept_team(X5,X8,X6,X7) )
& ( accept_leader(X5,X8)
| ~ accept_team(X5,X8,X6,X7) )
& ( accept_number(X5,X7)
| ~ accept_team(X5,X8,X6,X7) )
& ( ~ accept_city(X5,X6)
| ~ accept_leader(X5,X8)
| ~ accept_number(X5,X7)
| accept_team(X5,X8,X6,X7) ) ),
inference(distribute,[status(thm)],[569]) ).
cnf(571,plain,
( accept_team(X1,X2,X3,X4)
| ~ accept_number(X1,X4)
| ~ accept_leader(X1,X2)
| ~ accept_city(X1,X3) ),
inference(split_conjunct,[status(thm)],[570]) ).
cnf(582,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(split_conjunct,[status(thm)],[152]) ).
cnf(649,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(split_conjunct,[status(thm)],[219]) ).
cnf(786,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(split_conjunct,[status(thm)],[356]) ).
cnf(809,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(split_conjunct,[status(thm)],[424]) ).
cnf(847,plain,
( accept_team(christiansufferterrahumanitarianorganization,X1,towna,X2)
| ~ accept_leader(christiansufferterrahumanitarianorganization,X1)
| ~ accept_number(christiansufferterrahumanitarianorganization,X2) ),
inference(spm,[status(thm)],[571,649,theory(equality)]) ).
cnf(1417,plain,
( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,X1)
| ~ accept_number(christiansufferterrahumanitarianorganization,X1) ),
inference(spm,[status(thm)],[847,582,theory(equality)]) ).
cnf(1423,negated_conjecture,
~ accept_number(christiansufferterrahumanitarianorganization,n5),
inference(spm,[status(thm)],[809,1417,theory(equality)]) ).
cnf(1427,negated_conjecture,
$false,
inference(rw,[status(thm)],[1423,786,theory(equality)]) ).
cnf(1428,negated_conjecture,
$false,
inference(cn,[status(thm)],[1427,theory(equality)]) ).
cnf(1429,negated_conjecture,
$false,
1428,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/AGT/AGT003+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/tmpw1N8Ub/sel_AGT003+2.p_1 with time limit 29
% -prover status Theorem
% Problem AGT003+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/AGT/AGT003+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/AGT/AGT003+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
%
%------------------------------------------------------------------------------