TSTP Solution File: AGT003+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:53 EDT 2024
% Result : Theorem 7.65s 1.62s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 15 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 46 ( 21 ~; 16 |; 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 16 !; 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/sandbox/benchmark/theBenchmark.p',a1_1) ).
fof(f352,axiom,
accept_city(christiansufferterrahumanitarianorganization,towna),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',deduced_83) ).
fof(f353,axiom,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',deduced_84) ).
fof(f433,axiom,
accept_number(christiansufferterrahumanitarianorganization,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',deduced_164) ).
fof(f923,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_3) ).
fof(f924,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(negated_conjecture,[],[f923]) ).
fof(f943,plain,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(flattening,[],[f924]) ).
fof(f970,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(f971,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,[],[f970]) ).
fof(f1003,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,[],[f971]) ).
fof(f1419,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(cnf_transformation,[],[f352]) ).
fof(f1420,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(cnf_transformation,[],[f353]) ).
fof(f1500,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(cnf_transformation,[],[f433]) ).
fof(f1990,plain,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(cnf_transformation,[],[f943]) ).
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,[],[f1003]) ).
cnf(c_468,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(cnf_transformation,[],[f1419]) ).
cnf(c_469,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(cnf_transformation,[],[f1420]) ).
cnf(c_549,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(cnf_transformation,[],[f1500]) ).
cnf(c_1039,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(cnf_transformation,[],[f1990]) ).
cnf(c_15240,plain,
( ~ accept_number(christiansufferterrahumanitarianorganization,n5)
| ~ accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization)
| ~ accept_city(christiansufferterrahumanitarianorganization,towna) ),
inference(superposition,[status(thm)],[c_49,c_1039]) ).
cnf(c_15242,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_15240,c_468,c_469,c_549]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Thu May 2 22:19:31 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.65/1.62 % SZS status Started for theBenchmark.p
% 7.65/1.62 % SZS status Theorem for theBenchmark.p
% 7.65/1.62
% 7.65/1.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.65/1.62
% 7.65/1.62 ------ iProver source info
% 7.65/1.62
% 7.65/1.62 git: date: 2024-05-02 19:28:25 +0000
% 7.65/1.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.65/1.62 git: non_committed_changes: false
% 7.65/1.62
% 7.65/1.62 ------ Parsing...
% 7.65/1.62 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.65/1.62
% 7.65/1.62 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 7.65/1.62
% 7.65/1.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.65/1.62
% 7.65/1.62 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.65/1.62 ------ Proving...
% 7.65/1.62 ------ Problem Properties
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62 clauses 889
% 7.65/1.62 conjectures 1
% 7.65/1.62 EPR 606
% 7.65/1.62 Horn 888
% 7.65/1.62 unary 794
% 7.65/1.62 binary 73
% 7.65/1.62 lits 1048
% 7.65/1.62 lits eq 1
% 7.65/1.62 fd_pure 0
% 7.65/1.62 fd_pseudo 0
% 7.65/1.62 fd_cond 0
% 7.65/1.62 fd_pseudo_cond 1
% 7.65/1.62 AC symbols 0
% 7.65/1.62
% 7.65/1.62 ------ Input Options Time Limit: Unbounded
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62 ------
% 7.65/1.62 Current options:
% 7.65/1.62 ------
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62 ------ Proving...
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62 ------ Proving...
% 7.65/1.62
% 7.65/1.62
% 7.65/1.62 % SZS status Theorem for theBenchmark.p
% 7.65/1.62
% 7.65/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.65/1.62
% 7.65/1.62
%------------------------------------------------------------------------------