%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : AGT014+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 : Thu Sep 24 11:47:27 AM UTC 2026
% Result : Theorem 0.32s 0.69s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 11 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 49 ( 24 ~; 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 : 19 ( 4 sgn 5 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query_14,conjecture,
? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_14) ).
fof(deduced_13,axiom,
~ accept_city(countryamedicalorganization,coastvillage),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_13) ).
fof(a2_7,axiom,
! [X1] :
( ( accept_population(X1,other,n0)
& accept_population(X1,native,n85)
& accept_population(X1,muslim,n0)
& accept_population(X1,christian,n3)
& accept_population(X1,atheist,n12) )
<=> accept_city(X1,coastvillage) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a2_7) ).
fof(c_0_3,negated_conjecture,
~ ? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
inference(assume_negation,[status(cth)],[query_14]) ).
fof(c_0_4,negated_conjecture,
~ ? [X7,X8,X9] : ~ accept_population(X7,X8,X9),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(fof_simplification,[status(thm)],[deduced_13]) ).
fof(c_0_6,plain,
! [X46] :
( ( ~ accept_city(X46,coastvillage)
| accept_population(X46,other,n0) )
& ( ~ accept_city(X46,coastvillage)
| accept_population(X46,native,n85) )
& ( ~ accept_city(X46,coastvillage)
| accept_population(X46,muslim,n0) )
& ( ~ accept_city(X46,coastvillage)
| accept_population(X46,christian,n3) )
& ( ~ accept_city(X46,coastvillage)
| accept_population(X46,atheist,n12) )
& ( accept_city(X46,coastvillage)
| ~ accept_population(X46,other,n0)
| ~ accept_population(X46,native,n85)
| ~ accept_population(X46,muslim,n0)
| ~ accept_population(X46,christian,n3)
| ~ accept_population(X46,atheist,n12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_7])])])]) ).
fof(c_0_7,negated_conjecture,
! [X88,X89,X90] : accept_population(X88,X89,X90),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_8,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ accept_population(X1,other,n0)
| ~ accept_population(X1,native,n85)
| ~ accept_population(X1,muslim,n0)
| ~ accept_population(X1,christian,n3)
| ~ accept_population(X1,atheist,n12)
| accept_city(X1,coastvillage) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
accept_population(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
~ accept_city(countryamedicalorganization,coastvillage),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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_9,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10])]) ).
cnf(c_0_13,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : AGT014+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n007.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 12:47:21 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.32/0.69 % Version: 3.5.1
% 0.32/0.69 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.32/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.32/0.69 % Starting new_bool_3 with 600s (2) cores
% 0.32/0.69 % Starting new_bool_1 with 600s (2) cores
% 0.32/0.69 % Starting sh5l with 300s (1) cores
% 0.32/0.69 % new_bool_3 with pid 1112914 completed with status 9
% 0.32/0.69 % new_bool_1 with pid 1112915 completed with status 9
% 0.32/0.69 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1112913 completed with status 0
% 0.32/0.69 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.32/0.69 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.32/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.32/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.69 % No SInE strategy applied
% 0.32/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.32/0.69 % Scheduled 10 strats onto 3 cores with 900 seconds (900 total)
% 0.32/0.69 % Starting SubtermCWHack with 82s (1) cores
% 0.32/0.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.32/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 82s (1) cores
% 0.32/0.69 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1112928 completed with status 0
% 0.32/0.69 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.32/0.69 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.32/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.32/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.69 % No SInE strategy applied
% 0.32/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.32/0.69 % Scheduled 10 strats onto 3 cores with 900 seconds (900 total)
% 0.32/0.69 % Starting SubtermCWHack with 82s (1) cores
% 0.32/0.69 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.32/0.69 % Preprocessing time : 0.011 s
% 0.32/0.69
% 0.32/0.69 % Proof found!
% 0.32/0.69 % SZS status Theorem
% 0.32/0.69 % SZS output start CNFRefutation
% See solution above
% 0.32/0.69 % Parsed axioms : 923
% 0.32/0.69 % Removed by relevancy pruning/SinE : 0
% 0.32/0.69 % Initial clauses : 996
% 0.32/0.69 % Removed in clause preprocessing : 238
% 0.32/0.69 % Initial clauses in saturation : 758
% 0.32/0.69 % Processed clauses : 56
% 0.32/0.69 % ...of these trivial : 0
% 0.32/0.69 % ...subsumed : 0
% 0.32/0.69 % ...remaining for further processing : 56
% 0.32/0.69 % Other redundant clauses eliminated : 0
% 0.32/0.69 % Clauses deleted for lack of memory : 0
% 0.32/0.69 % Backward-subsumed : 0
% 0.32/0.69 % Backward-rewritten : 10
% 0.32/0.69 % Generated clauses : 0
% 0.32/0.69 % ...of the previous two non-redundant : 0
% 0.32/0.69 % ...aggressively subsumed : 0
% 0.32/0.69 % Contextual simplify-reflections : 0
% 0.32/0.69 % Paramodulations : 0
% 0.32/0.69 % Factorizations : 0
% 0.32/0.69 % NegExts : 0
% 0.32/0.69 % Equation resolutions : 0
% 0.32/0.69 % Disequality decompositions : 0
% 0.32/0.69 % Total rewrite steps : 7
% 0.32/0.69 % ...of those cached : 0
% 0.32/0.69 % Propositional unsat checks : 0
% 0.32/0.69 % Propositional check models : 0
% 0.32/0.69 % Propositional check unsatisfiable : 0
% 0.32/0.69 % Propositional clauses : 0
% 0.32/0.69 % Propositional clauses after purity: 0
% 0.32/0.69 % Propositional unsat core size : 0
% 0.32/0.69 % Propositional preprocessing time : 0.000
% 0.32/0.69 % Propositional encoding time : 0.000
% 0.32/0.69 % Propositional solver time : 0.000
% 0.32/0.69 % Success case prop preproc time : 0.000
% 0.32/0.69 % Success case prop encoding time : 0.000
% 0.32/0.69 % Success case prop solver time : 0.000
% 0.32/0.69 % Current number of processed clauses : 46
% 0.32/0.69 % Positive orientable unit clauses : 45
% 0.32/0.69 % Positive unorientable unit clauses: 0
% 0.32/0.69 % Negative unit clauses : 1
% 0.32/0.69 % Non-unit-clauses : 0
% 0.32/0.69 % Current number of unprocessed clauses: 702
% 0.32/0.69 % ...number of literals in the above : 742
% 0.32/0.69 % Current number of archived formulas : 0
% 0.32/0.69 % Current number of archived clauses : 11
% 0.32/0.69 % Clause-clause subsumption calls (NU) : 0
% 0.32/0.69 % Rec. Clause-clause subsumption calls : 0
% 0.32/0.69 % Non-unit clause-clause subsumptions : 0
% 0.32/0.69 % Unit Clause-clause subsumption calls : 1
% 0.32/0.69 % Rewrite failures with RHS unbound : 0
% 0.32/0.69 % BW rewrite match attempts : 10
% 0.32/0.69 % BW rewrite match successes : 10
% 0.32/0.69 % Condensation attempts : 0
% 0.32/0.69 % Condensation successes : 0
% 0.32/0.69 % Termbank termtop insertions : 29498
% 0.32/0.69 % Search garbage collected termcells : 1145
% 0.32/0.69
% 0.32/0.69 % -------------------------------------------------
% 0.32/0.69 % User time : 0.024 s
% 0.32/0.69 % System time : 0.011 s
% 0.32/0.69 % Total time : 0.035 s
% 0.32/0.69 % Maximum resident set size: 5016 pages
% 0.32/0.69
% 0.32/0.69 % -------------------------------------------------
% 0.32/0.69 % User time : 0.120 s
% 0.32/0.69 % System time : 0.094 s
% 0.32/0.69 % Total time : 0.214 s
% 0.32/0.69 % Maximum resident set size: 5376 pages
% 0.32/0.69 % E exiting
%------------------------------------------------------------------------------