%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : AGT014+2 : TPTP v9.2.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n019.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 : Tue May 5 04:03:47 PM UTC 2026
% Result : Theorem 0.51s 1.71s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 46 ( 21 ~; 15 |; 9 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 16 ( 4 sgn 5 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_14,conjecture,
? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_14) ).
fof(a2_7,axiom,
! [X1] :
( ( accept_population(X1,atheist,n12)
& accept_population(X1,christian,n3)
& accept_population(X1,muslim,n0)
& accept_population(X1,native,n85)
& accept_population(X1,other,n0) )
<=> accept_city(X1,coastvillage) ),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a2_7) ).
fof(deduced_13,axiom,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+2.ax',deduced_13) ).
fof(c_0_3,negated_conjecture,
~ ? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_14])]) ).
fof(c_0_4,plain,
! [X119] :
( ( ~ accept_population(X119,atheist,n12)
| ~ accept_population(X119,christian,n3)
| ~ accept_population(X119,muslim,n0)
| ~ accept_population(X119,native,n85)
| ~ accept_population(X119,other,n0)
| accept_city(X119,coastvillage) )
& ( accept_population(X119,atheist,n12)
| ~ accept_city(X119,coastvillage) )
& ( accept_population(X119,christian,n3)
| ~ accept_city(X119,coastvillage) )
& ( accept_population(X119,muslim,n0)
| ~ accept_city(X119,coastvillage) )
& ( accept_population(X119,native,n85)
| ~ accept_city(X119,coastvillage) )
& ( accept_population(X119,other,n0)
| ~ accept_city(X119,coastvillage) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_7])])]) ).
fof(c_0_5,negated_conjecture,
! [X161,X162,X163] : accept_population(X161,X162,X163),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_6,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(fof_simplification,[status(thm)],[deduced_13]) ).
cnf(c_0_7,plain,
( accept_city(X1,coastvillage)
| ~ accept_population(X1,atheist,n12)
| ~ accept_population(X1,christian,n3)
| ~ accept_population(X1,muslim,n0)
| ~ accept_population(X1,native,n85)
| ~ accept_population(X1,other,n0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
accept_population(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
accept_city(X1,coastvillage),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8])]) ).
cnf(c_0_11,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : AGT014+2 : TPTP v9.2.1. Bugfixed v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 10:10:14 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.51/1.71 % Version : CSE_E---1.7
% 0.51/1.71 % Problem : theBenchmark.p
% 0.51/1.71 % SZS status Theorem for theBenchmark.p
% 0.51/1.71 % SZS output start CNFRefutation
% See solution above
% 0.51/1.71 % Total time : 1.326s
%------------------------------------------------------------------------------