%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : AGT004+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 12:50:56 PM UTC 2026
% Result : Theorem 2.64s 1.08s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 37 ( 17 ~; 11 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 24 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( accept_team(X0,X3,X1,X2)
<=> ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a1_1) ).
fof(f282,axiom,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+2.ax',deduced_13) ).
fof(f923,conjecture,
~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_4) ).
fof(f924,negated_conjecture,
~ ~ accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(negated_conjecture,[status(cth)],[f923]) ).
fof(f925,plain,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(flattening,[],[f924]) ).
fof(f1020,plain,
! [X0,X1,X2,X3] :
( ( ~ accept_team(X0,X3,X1,X2)
| ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) ) )
& ( ~ accept_number(X0,X2)
| ~ accept_leader(X0,X3)
| ~ accept_city(X0,X1)
| accept_team(X0,X3,X1,X2) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1021,plain,
! [X0,X1,X2,X3] :
( ( ~ accept_team(X0,X3,X1,X2)
| ( accept_number(X0,X2)
& accept_leader(X0,X3)
& accept_city(X0,X1) ) )
& ( ~ accept_number(X0,X2)
| ~ accept_leader(X0,X3)
| ~ accept_city(X0,X1)
| accept_team(X0,X3,X1,X2) ) ),
inference(flattening,[],[f1020]) ).
fof(f1022,plain,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(cnf_transformation,[],[f925]) ).
fof(f1032,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(cnf_transformation,[],[f282]) ).
fof(f1171,plain,
! [X2,X3,X0,X1] :
( ~ accept_team(X0,X3,X1,X2)
| accept_city(X0,X1) ),
inference(cnf_transformation,[],[f1021]) ).
tcf(c_49,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(cnf_transformation,[],[f1022]) ).
tcf(c_59,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(cnf_transformation,[],[f1032]) ).
tcf(c_197,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( accept_city(X0,X2)
| ~ accept_team(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f1171]) ).
tcf(c_656,plain,
! [X0_iProver_accept_team_2: iProver_accept_team_2,X0_iProver_accept_team_3: iProver_accept_team_3,X0_iProver_accept_team_4: iProver_accept_team_4,X1_iProver_accept_team_2: iProver_accept_team_2] :
( accept_city(X0_iProver_accept_team_2,X0_iProver_accept_team_3)
| ~ accept_team(X0_iProver_accept_team_2,X1_iProver_accept_team_2,X0_iProver_accept_team_3,X0_iProver_accept_team_4) ),
inference(subtyping,[status(esa)],[c_197]) ).
tcf(c_795,negated_conjecture,
accept_team(countryamedicalorganization,countryahumanitarianorganization,coastvillage,n5),
inference(subtyping,[status(esa)],[c_49]) ).
tcf(c_1024,plain,
accept_city(countryamedicalorganization,coastvillage),
inference(resolution,[status(thm)],[c_656,c_795]) ).
tcf(c_1025,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1024,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : AGT004+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Fri Sep 25 04:20:35 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/0.33
% 0.04/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.33
% 0.04/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 2.64/1.08 % SZS status Started for theBenchmark.p
% 2.64/1.08 % SZS status Theorem for theBenchmark.p
% 2.64/1.08
% 2.64/1.08 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.64/1.08
% 2.64/1.08 % ------ iProver source info
% 2.64/1.08
% 2.64/1.08 % git: date: 2026-07-19 20:42:38 +0200
% 2.64/1.08 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.64/1.08 % git: non_committed_changes: false
% 2.64/1.08
% 2.64/1.08 % ------ Parsing...
% 2.64/1.08 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_horn
% 2.64/1.08 %
% 2.64/1.08
% 2.64/1.08 % ------ Preprocessing... sf_s rm: 0 0s sf_e sf_s rm: 0 0s sf_e %
% 2.64/1.08
% 2.64/1.08 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 2.64/1.08 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.64/1.08 % ------ Proving...
% 2.64/1.08 % ------ Problem Properties
% 2.64/1.08
% 2.64/1.08 %
% 2.64/1.08 % clauses 353
% 2.64/1.08 % conjectures 1
% 2.64/1.08 % EPR 353
% 2.64/1.08 % Horn 353
% 2.64/1.08 % unary 349
% 2.64/1.08 % binary 3
% 2.64/1.08 % lits 359
% 2.64/1.08 % lits eq 0
% 2.64/1.08 % fd_pure 0
% 2.64/1.08 % fd_pseudo 0
% 2.64/1.08 % fd_cond 0
% 2.64/1.08 % fd_pseudo_cond 0
% 2.64/1.08 % AC symbols 0
% 2.64/1.08
% 2.64/1.08 % ------ Schedule EPR Horn non eq is on
% 2.64/1.08
% 2.64/1.08 % ------ no equalities: superposition off
% 2.64/1.08
% 2.64/1.08 % ------ Option_epr_horn Time Limit: Unbounded
% 2.64/1.08
% 2.64/1.08
% 2.64/1.08 % ------
% 2.64/1.08 % Current options:
% 2.64/1.08 % ------
% 2.64/1.08
% 2.64/1.08
% 2.64/1.08 %
% 2.64/1.08
% 2.64/1.08 % ------ Proving...
% 2.64/1.08 %
% 2.64/1.08
% 2.64/1.08 % SZS status Theorem for theBenchmark.p
% 2.64/1.08
% 2.64/1.08 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.64/1.08
% 2.64/1.08
%------------------------------------------------------------------------------