TSTP Solution File: AGT016+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 14 12:04:11 EDT 2022
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 0 equ; 15 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 15 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(47,axiom,
accept_population(muslimcountrybhumanitarianorganization,u,v),
file('AGT016+1.p',unknown),
[] ).
cnf(106,axiom,
the_agent_not_in_any_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
file('AGT016+1.p',unknown),
[] ).
cnf(107,axiom,
any_agent_in_all_proposed_teams(muslimcountrybhumanitarianorganization,sufferterragovernment,towna),
file('AGT016+1.p',unknown),
[] ).
cnf(294,axiom,
( ~ any_agent_in_all_proposed_teams(u,v,w)
| accept_leader(u,v) ),
file('AGT016+1.p',unknown),
[] ).
cnf(609,axiom,
( ~ accept_city(u,v)
| ~ accept_leader(u,w)
| ~ the_agent_not_in_any_proposed_teams(u,w,v) ),
file('AGT016+1.p',unknown),
[] ).
cnf(621,axiom,
( ~ accept_population(u,other,n0)
| ~ accept_population(u,native,n0)
| ~ accept_population(u,muslim,n1)
| ~ accept_population(u,christian,n24)
| ~ accept_population(u,atheist,n75)
| accept_city(u,towna) ),
file('AGT016+1.p',unknown),
[] ).
cnf(680,plain,
( ~ accept_population(muslimcountrybhumanitarianorganization,atheist,n75)
| ~ accept_population(muslimcountrybhumanitarianorganization,muslim,n1)
| ~ accept_population(muslimcountrybhumanitarianorganization,native,n0)
| ~ accept_population(muslimcountrybhumanitarianorganization,other,n0)
| accept_city(muslimcountrybhumanitarianorganization,towna) ),
inference(res,[status(thm),theory(equality)],[47,621]),
[iquote('0:Res:47.0,621.1')] ).
cnf(704,plain,
accept_city(muslimcountrybhumanitarianorganization,towna),
inference(mrr,[status(thm)],[680,47]),
[iquote('0:MRR:680.0,680.1,680.2,680.3,47.0,47.0,47.0,47.0')] ).
cnf(736,plain,
accept_leader(muslimcountrybhumanitarianorganization,sufferterragovernment),
inference(res,[status(thm),theory(equality)],[107,294]),
[iquote('0:Res:107.0,294.0')] ).
cnf(1402,plain,
( ~ accept_city(muslimcountrybhumanitarianorganization,towna)
| ~ accept_leader(muslimcountrybhumanitarianorganization,sufferterragovernment) ),
inference(res,[status(thm),theory(equality)],[106,609]),
[iquote('0:Res:106.0,609.2')] ).
cnf(1405,plain,
$false,
inference(mrr,[status(thm)],[1402,704,736]),
[iquote('0:MRR:1402.0,1402.1,704.0,736.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : AGT016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 4 06:55:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.60/0.77
% 0.60/0.77 SPASS V 3.9
% 0.60/0.77 SPASS beiseite: Proof found.
% 0.60/0.77 % SZS status Theorem
% 0.60/0.77 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.77 SPASS derived 761 clauses, backtracked 0 clauses, performed 0 splits and kept 1032 clauses.
% 0.60/0.77 SPASS allocated 98937 KBytes.
% 0.60/0.77 SPASS spent 0:00:00.41 on the problem.
% 0.60/0.77 0:00:00.04 for the input.
% 0.60/0.77 0:00:00.08 for the FLOTTER CNF translation.
% 0.60/0.77 0:00:00.03 for inferences.
% 0.60/0.77 0:00:00.00 for the backtracking.
% 0.60/0.77 0:00:00.13 for the reduction.
% 0.60/0.77
% 0.60/0.77
% 0.60/0.77 Here is a proof with depth 1, length 11 :
% 0.60/0.77 % SZS output start Refutation
% See solution above
% 0.60/0.77 Formulae used in the proof : query_16 event_248 event_249 a1_5 a1_6 a2_9
% 0.60/0.77
%------------------------------------------------------------------------------