TSTP Solution File: AGT003+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : AGT003+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : 300s
% DateTime : Fri May 3 02:02:52 EDT 2024
% Result : Theorem 4.21s 1.12s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 23 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 44 ( 6 sgn 28 !; 0 ?)
% 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/theBenchmark.p',a1_1) ).
fof(f46,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',event_26) ).
fof(f110,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',event_90) ).
fof(f113,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',event_93) ).
fof(f556,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_3) ).
fof(f557,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(negated_conjecture,[],[f556]) ).
fof(f576,plain,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(flattening,[],[f557]) ).
fof(f603,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(f604,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,[],[f603]) ).
fof(f633,plain,
! [X2,X3,X0,X1] :
( accept_city(X0,X1)
| ~ accept_team(X0,X3,X1,X2) ),
inference(cnf_transformation,[],[f604]) ).
fof(f634,plain,
! [X2,X3,X0,X1] :
( accept_leader(X0,X3)
| ~ accept_team(X0,X3,X1,X2) ),
inference(cnf_transformation,[],[f604]) ).
fof(f635,plain,
! [X2,X3,X0,X1] :
( accept_number(X0,X2)
| ~ accept_team(X0,X3,X1,X2) ),
inference(cnf_transformation,[],[f604]) ).
fof(f636,plain,
! [X2,X3,X0,X1] :
( accept_team(X0,X3,X1,X2)
| ~ accept_number(X0,X2)
| ~ accept_leader(X0,X3)
| ~ accept_city(X0,X1) ),
inference(cnf_transformation,[],[f604]) ).
fof(f746,plain,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
inference(cnf_transformation,[],[f46]) ).
fof(f810,plain,
accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
inference(cnf_transformation,[],[f110]) ).
fof(f813,plain,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
inference(cnf_transformation,[],[f113]) ).
fof(f1256,plain,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(cnf_transformation,[],[f576]) ).
cnf(c_49,plain,
( ~ accept_number(X0,X1)
| ~ accept_leader(X0,X2)
| ~ accept_city(X0,X3)
| accept_team(X0,X2,X3,X1) ),
inference(cnf_transformation,[],[f636]) ).
cnf(c_50,plain,
( ~ accept_team(X0,X1,X2,X3)
| accept_number(X0,X3) ),
inference(cnf_transformation,[],[f635]) ).
cnf(c_51,plain,
( ~ accept_team(X0,X1,X2,X3)
| accept_leader(X0,X1) ),
inference(cnf_transformation,[],[f634]) ).
cnf(c_52,plain,
( ~ accept_team(X0,X1,X2,X3)
| accept_city(X0,X2) ),
inference(cnf_transformation,[],[f633]) ).
cnf(c_162,plain,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
inference(cnf_transformation,[],[f746]) ).
cnf(c_226,plain,
accept_team(christiansufferterrahumanitarianorganization,countryahumanitarianorganization,coastvillage,n5),
inference(cnf_transformation,[],[f810]) ).
cnf(c_229,plain,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
inference(cnf_transformation,[],[f813]) ).
cnf(c_672,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(cnf_transformation,[],[f1256]) ).
cnf(c_4077,plain,
( ~ accept_number(christiansufferterrahumanitarianorganization,n5)
| ~ accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization)
| ~ accept_city(christiansufferterrahumanitarianorganization,towna)
| accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_4534,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(superposition,[status(thm)],[c_162,c_52]) ).
cnf(c_4677,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(superposition,[status(thm)],[c_229,c_51]) ).
cnf(c_4788,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(superposition,[status(thm)],[c_226,c_50]) ).
cnf(c_4859,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4788,c_4677,c_4534,c_4077,c_672]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : AGT003+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 22:26:52 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.21/1.12 % SZS status Started for theBenchmark.p
% 4.21/1.12 % SZS status Theorem for theBenchmark.p
% 4.21/1.12
% 4.21/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.21/1.12
% 4.21/1.12 ------ iProver source info
% 4.21/1.12
% 4.21/1.12 git: date: 2024-05-02 19:28:25 +0000
% 4.21/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.21/1.12 git: non_committed_changes: false
% 4.21/1.12
% 4.21/1.12 ------ Parsing...
% 4.21/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.21/1.12
% 4.21/1.12 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 pe_s pe_e
% 4.21/1.12
% 4.21/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 4 0s scvd_e snvd_s sp: 0 0s snvd_e
% 4.21/1.12
% 4.21/1.12 ------ Preprocessing...
% 4.21/1.12 ------ Proving...
% 4.21/1.12 ------ Problem Properties
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12 clauses 618
% 4.21/1.12 conjectures 1
% 4.21/1.12 EPR 332
% 4.21/1.12 Horn 616
% 4.21/1.12 unary 519
% 4.21/1.12 binary 75
% 4.21/1.12 lits 781
% 4.21/1.12 lits eq 1
% 4.21/1.12 fd_pure 0
% 4.21/1.12 fd_pseudo 0
% 4.21/1.12 fd_cond 0
% 4.21/1.12 fd_pseudo_cond 1
% 4.21/1.12 AC symbols 0
% 4.21/1.12
% 4.21/1.12 ------ Input Options Time Limit: Unbounded
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12 ------
% 4.21/1.12 Current options:
% 4.21/1.12 ------
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12 ------ Proving...
% 4.21/1.12
% 4.21/1.12
% 4.21/1.12 % SZS status Theorem for theBenchmark.p
% 4.21/1.12
% 4.21/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.21/1.12
% 4.21/1.12
%------------------------------------------------------------------------------