%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : AGT003+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 : n012.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:24 AM UTC 2026
% Result : Theorem 0.11s 10.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 12 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 34 ( 16 ~; 12 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 15 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a1_1,axiom,
! [X1,X2,X3,X4] :
( accept_team(X1,X4,X2,X3)
<=> ( accept_number(X1,X3)
& accept_leader(X1,X4)
& accept_city(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a1_1) ).
fof(query_3,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_3) ).
fof(deduced_164,axiom,
accept_number(christiansufferterrahumanitarianorganization,n5),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_164) ).
fof(deduced_84,axiom,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_84) ).
fof(deduced_83,axiom,
accept_city(christiansufferterrahumanitarianorganization,towna),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+2.ax',deduced_83) ).
fof(c_0_5,plain,
! [X18,X19,X20,X21] :
( ( accept_team(X18,X21,X19,X20)
| ~ accept_number(X18,X20)
| ~ accept_leader(X18,X21)
| ~ accept_city(X18,X19) )
& ( ~ accept_team(X18,X21,X19,X20)
| accept_number(X18,X20) )
& ( ~ accept_team(X18,X21,X19,X20)
| accept_leader(X18,X21) )
& ( ~ accept_team(X18,X21,X19,X20)
| accept_city(X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])])]) ).
fof(c_0_6,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(assume_negation,[status(cth)],[query_3]) ).
cnf(c_0_7,plain,
( ~ accept_number(X1,X4)
| ~ accept_leader(X1,X3)
| ~ accept_city(X1,X2)
| accept_team(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(split_conjunct,[status(thm)],[deduced_164]) ).
fof(c_0_9,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ accept_city(christiansufferterrahumanitarianorganization,X2)
| ~ accept_leader(christiansufferterrahumanitarianorganization,X1)
| accept_team(christiansufferterrahumanitarianorganization,X1,X2,n5) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(split_conjunct,[status(thm)],[deduced_84]) ).
fof(c_0_12,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ accept_city(christiansufferterrahumanitarianorganization,X1)
| accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,X1,n5) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(split_conjunct,[status(thm)],[deduced_83]) ).
cnf(c_0_15,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : AGT003+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.36 % Computer : n012.cluster.edu
% 0.09/10.36 % Model : x86_64 x86_64
% 0.09/10.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.36 % Memory : 8046.5625MB
% 0.09/10.36 % OS : Linux 6.8.0-71-generic
% 0.09/10.36 % CPULimit : 300
% 0.09/10.36 % WCLimit : 300
% 0.09/10.36 % DateTime : Mon Sep 21 12:48:03 UTC 2026
% 0.09/10.36 % CPUTime :
% 0.09/10.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.38 Running first-order theorem proving
% 0.09/10.38 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.11/10.42 % Version: 3.5.1
% 0.11/10.42 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/10.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/10.42 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/10.42 % Starting new_bool_3 with 600s (2) cores
% 0.11/10.42 % Starting new_bool_1 with 600s (2) cores
% 0.11/10.42 % Starting sh5l with 300s (1) cores
% 0.11/10.42 % new_bool_1 with pid 2390897 completed with status 0
% 0.11/10.42 % Result found by new_bool_1
% 0.11/10.42 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/10.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/10.42 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/10.42 % Starting new_bool_3 with 600s (2) cores
% 0.11/10.42 % Starting new_bool_1 with 600s (2) cores
% 0.11/10.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/10.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/10.42 % Search class: FHUNF-FSLM11-SFFFFFNN
% 0.11/10.42 % partial match(2): FGUNF-FSLF11-SFFFFFNN
% 0.11/10.42 % Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.11/10.42 % Starting SubtermCWHack with 61s (1) cores
% 0.11/10.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 225s (1) cores
% 0.11/10.42 % SubtermCWHack with pid 2390899 completed with status 0
% 0.11/10.42 % Result found by SubtermCWHack
% 0.11/10.42 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.11/10.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/10.42 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.11/10.42 % Starting new_bool_3 with 600s (2) cores
% 0.11/10.42 % Starting new_bool_1 with 600s (2) cores
% 0.11/10.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/10.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/10.42 % Search class: FHUNF-FSLM11-SFFFFFNN
% 0.11/10.42 % partial match(2): FGUNF-FSLF11-SFFFFFNN
% 0.11/10.42 % Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.11/10.42 % Starting SubtermCWHack with 61s (1) cores
% 0.11/10.42 % Preprocessing time : 0.003 s
% 0.11/10.42
% 0.11/10.42 % Proof found!
% 0.11/10.42 % SZS status Theorem
% 0.11/10.42 % SZS output start CNFRefutation
% See solution above
% 0.11/10.42 % Parsed axioms : 923
% 0.11/10.42 % Removed by relevancy pruning/SinE : 442
% 0.11/10.42 % Initial clauses : 484
% 0.11/10.42 % Removed in clause preprocessing : 0
% 0.11/10.42 % Initial clauses in saturation : 484
% 0.11/10.42 % Processed clauses : 718
% 0.11/10.42 % ...of these trivial : 37
% 0.11/10.42 % ...subsumed : 0
% 0.11/10.42 % ...remaining for further processing : 681
% 0.11/10.42 % Other redundant clauses eliminated : 0
% 0.11/10.42 % Clauses deleted for lack of memory : 0
% 0.11/10.42 % Backward-subsumed : 0
% 0.11/10.42 % Backward-rewritten : 0
% 0.11/10.42 % Generated clauses : 1225
% 0.11/10.42 % ...of the previous two non-redundant : 378
% 0.11/10.42 % ...aggressively subsumed : 0
% 0.11/10.42 % Contextual simplify-reflections : 0
% 0.11/10.42 % Paramodulations : 1225
% 0.11/10.42 % Factorizations : 0
% 0.11/10.42 % NegExts : 0
% 0.11/10.42 % Equation resolutions : 0
% 0.11/10.42 % Disequality decompositions : 0
% 0.11/10.42 % Total rewrite steps : 882
% 0.11/10.42 % ...of those cached : 727
% 0.11/10.42 % Propositional unsat checks : 0
% 0.11/10.42 % Propositional check models : 0
% 0.11/10.42 % Propositional check unsatisfiable : 0
% 0.11/10.42 % Propositional clauses : 0
% 0.11/10.42 % Propositional clauses after purity: 0
% 0.11/10.42 % Propositional unsat core size : 0
% 0.11/10.42 % Propositional preprocessing time : 0.000
% 0.11/10.42 % Propositional encoding time : 0.000
% 0.11/10.42 % Propositional solver time : 0.000
% 0.11/10.42 % Success case prop preproc time : 0.000
% 0.11/10.42 % Success case prop encoding time : 0.000
% 0.11/10.42 % Success case prop solver time : 0.000
% 0.11/10.42 % Current number of processed clauses : 681
% 0.11/10.42 % Positive orientable unit clauses : 563
% 0.11/10.42 % Positive unorientable unit clauses: 0
% 0.11/10.42 % Negative unit clauses : 46
% 0.11/10.42 % Non-unit-clauses : 72
% 0.11/10.42 % Current number of unprocessed clauses: 142
% 0.11/10.42 % ...number of literals in the above : 332
% 0.11/10.42 % Current number of archived formulas : 0
% 0.11/10.42 % Current number of archived clauses : 0
% 0.11/10.42 % Clause-clause subsumption calls (NU) : 275
% 0.11/10.42 % Rec. Clause-clause subsumption calls : 275
% 0.11/10.42 % Non-unit clause-clause subsumptions : 0
% 0.11/10.42 % Unit Clause-clause subsumption calls : 460
% 0.11/10.42 % Rewrite failures with RHS unbound : 0
% 0.11/10.42 % BW rewrite match attempts : 2456
% 0.11/10.42 % BW rewrite match successes : 0
% 0.11/10.42 % Condensation attempts : 0
% 0.11/10.42 % Condensation successes : 0
% 0.11/10.42 % Termbank termtop insertions : 24006
% 0.11/10.42 % Search garbage collected termcells : 1854
% 0.11/10.42
% 0.11/10.42 % -------------------------------------------------
% 0.11/10.42 % User time : 0.014 s
% 0.11/10.42 % System time : 0.008 s
% 0.11/10.42 % Total time : 0.022 s
% 0.11/10.42 % Maximum resident set size: 5016 pages
% 0.11/10.42
% 0.11/10.42 % -------------------------------------------------
% 0.11/10.42 % User time : 0.031 s
% 0.11/10.42 % System time : 0.018 s
% 0.11/10.42 % Total time : 0.049 s
% 0.11/10.42 % Maximum resident set size: 5120 pages
% 0.11/10.42 % E exiting
%------------------------------------------------------------------------------