%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : AGT016+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 : n027.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:48 PM UTC 2026
% Result : Theorem 1.57s 1.84s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 36 ( 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 : 11 ( 2 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_16,conjecture,
? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query_16) ).
fof(a2_9,axiom,
! [X1] :
( ( accept_population(X1,atheist,n75)
& accept_population(X1,christian,n24)
& accept_population(X1,muslim,n1)
& accept_population(X1,native,n0)
& accept_population(X1,other,n0) )
<=> accept_city(X1,towna) ),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+0.ax',a2_9) ).
fof(deduced_366,axiom,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
file('/export/starexec/sandbox2/benchmark/Axioms/AGT001+2.ax',deduced_366) ).
fof(c_0_3,negated_conjecture,
~ ? [X7,X8] : ~ accept_population(muslimcountrybhumanitarianorganization,X7,X8),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_16])]) ).
fof(c_0_4,plain,
! [X120] :
( ( ~ accept_population(X120,atheist,n75)
| ~ accept_population(X120,christian,n24)
| ~ accept_population(X120,muslim,n1)
| ~ accept_population(X120,native,n0)
| ~ accept_population(X120,other,n0)
| accept_city(X120,towna) )
& ( accept_population(X120,atheist,n75)
| ~ accept_city(X120,towna) )
& ( accept_population(X120,christian,n24)
| ~ accept_city(X120,towna) )
& ( accept_population(X120,muslim,n1)
| ~ accept_city(X120,towna) )
& ( accept_population(X120,native,n0)
| ~ accept_city(X120,towna) )
& ( accept_population(X120,other,n0)
| ~ accept_city(X120,towna) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_9])])]) ).
fof(c_0_5,negated_conjecture,
! [X160,X161] : accept_population(muslimcountrybhumanitarianorganization,X160,X161),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_6,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(fof_simplification,[status(thm)],[deduced_366]) ).
cnf(c_0_7,plain,
( accept_city(X1,towna)
| ~ accept_population(X1,atheist,n75)
| ~ accept_population(X1,christian,n24)
| ~ accept_population(X1,muslim,n1)
| ~ accept_population(X1,native,n0)
| ~ accept_population(X1,other,n0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
accept_population(muslimcountrybhumanitarianorganization,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
~ accept_city(muslimcountrybhumanitarianorganization,towna),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : AGT016+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.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue May 5 10:10:50 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.57/1.84 % Version : CSE_E---1.7
% 1.57/1.84 % Problem : theBenchmark.p
% 1.57/1.84 % SZS status Theorem for theBenchmark.p
% 1.57/1.84 % SZS output start CNFRefutation
% See solution above
% 1.57/1.85 % Total time : 1.429s
%------------------------------------------------------------------------------