%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : AGT005+1 : 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 : n001.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:25 AM UTC 2026
% Result : Theorem 0.15s 0.95s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 27 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 85 ( 38 ~; 34 |; 9 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-1 aty)
% Number of variables : 59 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn_positive_less_transitivity,axiom,
! [X7,X8,X9] :
( ( rdn_positive_less(rdnn(X8),rdnn(X9))
& rdn_positive_less(rdnn(X7),rdnn(X8)) )
=> rdn_positive_less(rdnn(X7),rdnn(X9)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).
fof(rdn_positive_less45,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less45) ).
fof(less_entry_point_pos_pos,axiom,
! [X7,X8,X16,X17] :
( ( rdn_positive_less(X16,X17)
& rdn_translate(X8,rdn_pos(X17))
& rdn_translate(X7,rdn_pos(X16)) )
=> less(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(rdn_positive_less56,axiom,
rdn_positive_less(rdnn(n5),rdnn(n6)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less56) ).
fof(rdn_positive_less34,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less34) ).
fof(rdn6,axiom,
rdn_translate(n6,rdn_pos(rdnn(n6))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn6) ).
fof(a1_2,axiom,
! [X1,X3,X5] :
( ( less(X5,X3)
& accept_number(X1,X3) )
=> accept_number(X1,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+0.ax',a1_2) ).
fof(rdn3,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).
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_5,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query_5) ).
fof(event_93,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_93) ).
fof(event_140,axiom,
accept_number(christiansufferterrahumanitarianorganization,n6),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_140) ).
fof(event_26,axiom,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
file('/export/starexec/sandbox/benchmark/Axioms/AGT001+1.ax',event_26) ).
fof(c_0_13,plain,
! [X21,X22,X23] :
( rdn_positive_less(rdnn(X21),rdnn(X23))
| ~ rdn_positive_less(rdnn(X22),rdnn(X23))
| ~ rdn_positive_less(rdnn(X21),rdnn(X22)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_transitivity])])]) ).
cnf(c_0_14,plain,
( ~ rdn_positive_less(rdnn(X2),rdnn(X3))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| rdn_positive_less(rdnn(X1),rdnn(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(split_conjunct,[status(thm)],[rdn_positive_less45]) ).
fof(c_0_16,plain,
! [X34,X35,X36,X37] :
( less(X34,X35)
| ~ rdn_positive_less(X36,X37)
| ~ rdn_translate(X35,rdn_pos(X37))
| ~ rdn_translate(X34,rdn_pos(X36)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])]) ).
cnf(c_0_17,plain,
rdn_positive_less(rdnn(n5),rdnn(n6)),
inference(split_conjunct,[status(thm)],[rdn_positive_less56]) ).
cnf(c_0_18,plain,
( ~ rdn_positive_less(rdnn(X1),rdnn(n4))
| rdn_positive_less(rdnn(X1),rdnn(n5)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[rdn_positive_less34]) ).
cnf(c_0_20,plain,
( ~ rdn_positive_less(X2,X4)
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X2))
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
rdn_translate(n6,rdn_pos(rdnn(n6))),
inference(split_conjunct,[status(thm)],[rdn6]) ).
cnf(c_0_22,plain,
( ~ rdn_positive_less(rdnn(X1),rdnn(n5))
| rdn_positive_less(rdnn(X1),rdnn(n6)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_23,plain,
rdn_positive_less(rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X18,X19,X20] :
( accept_number(X18,X20)
| ~ less(X20,X19)
| ~ accept_number(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_2])])]) ).
cnf(c_0_25,plain,
( ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdnn(n6))
| less(X1,n6) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[rdn3]) ).
cnf(c_0_27,plain,
rdn_positive_less(rdnn(n3),rdnn(n6)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X64,X65,X66,X67] :
( ( accept_team(X64,X67,X65,X66)
| ~ accept_number(X64,X66)
| ~ accept_leader(X64,X67)
| ~ accept_city(X64,X65) )
& ( ~ accept_team(X64,X67,X65,X66)
| accept_number(X64,X66) )
& ( ~ accept_team(X64,X67,X65,X66)
| accept_leader(X64,X67) )
& ( ~ accept_team(X64,X67,X65,X66)
| accept_city(X64,X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])])]) ).
cnf(c_0_29,plain,
( ~ less(X3,X2)
| ~ accept_number(X1,X2)
| accept_number(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
less(n3,n6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
fof(c_0_31,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
inference(assume_negation,[status(cth)],[query_5]) ).
cnf(c_0_32,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_28]) ).
cnf(c_0_33,plain,
( ~ accept_number(X1,n6)
| accept_number(X1,n3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( ~ accept_team(X1,X2,X3,X4)
| accept_leader(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,coastvillage,n6),
inference(split_conjunct,[status(thm)],[event_93]) ).
fof(c_0_36,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ accept_city(X1,X3)
| ~ accept_leader(X1,X2)
| ~ accept_number(X1,n6)
| accept_team(X1,X2,X3,n3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
accept_number(christiansufferterrahumanitarianorganization,n6),
inference(split_conjunct,[status(thm)],[event_140]) ).
cnf(c_0_40,plain,
( ~ accept_team(X1,X3,X2,X4)
| accept_city(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
accept_team(christiansufferterrahumanitarianorganization,countryacivilorganization,towna,n6),
inference(split_conjunct,[status(thm)],[event_26]) ).
fof(c_0_42,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
inference(fof_nnf,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( ~ accept_city(christiansufferterrahumanitarianorganization,X1)
| accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,X1,n3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : AGT005+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.56 % Computer : n001.cluster.edu
% 0.11/0.56 % Model : x86_64 x86_64
% 0.11/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.56 % Memory : 8046.5625MB
% 0.11/0.56 % OS : Linux 6.8.0-71-generic
% 0.11/0.56 % CPULimit : 300
% 0.11/0.56 % WCLimit : 300
% 0.11/0.56 % DateTime : Mon Sep 21 12:53:45 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.60 Running first-order theorem proving
% 0.15/0.60 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.15/0.95 % Version: 3.5.1
% 0.15/0.95 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.95 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.95 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.95 % Starting new_bool_1 with 600s (2) cores
% 0.15/0.95 % Starting sh5l with 300s (1) cores
% 0.15/0.95 % new_bool_3 with pid 3157327 completed with status 9
% 0.15/0.95 % new_bool_1 with pid 3157328 completed with status 9
% 0.15/0.95 % sh5l with pid 3157329 completed with status 0
% 0.15/0.95 % Result found by sh5l
% 0.15/0.95 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.95 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.95 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.95 % Starting new_bool_1 with 600s (2) cores
% 0.15/0.95 % Starting sh5l with 300s (1) cores
% 0.15/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.95 % Search class: FGHSF-FFLM21-SFFFFFNN
% 0.15/0.95 % partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.15/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.95 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.95 % SubtermCWHack with pid 3157334 completed with status 0
% 0.15/0.95 % Result found by SubtermCWHack
% 0.15/0.95 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.15/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.95 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.15/0.95 % Starting new_bool_3 with 600s (2) cores
% 0.15/0.95 % Starting new_bool_1 with 600s (2) cores
% 0.15/0.95 % Starting sh5l with 300s (1) cores
% 0.15/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.95 % Search class: FGHSF-FFLM21-SFFFFFNN
% 0.15/0.95 % partial match(1): FGHSF-FFMM21-SFFFFFNN
% 0.15/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.95 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.95 % Preprocessing time : 0.004 s
% 0.15/0.95
% 0.15/0.95 % Proof found!
% 0.15/0.95 % SZS status Theorem
% 0.15/0.95 % SZS output start CNFRefutation
% See solution above
% 0.15/0.95 % Parsed axioms : 556
% 0.15/0.95 % Removed by relevancy pruning/SinE : 259
% 0.15/0.95 % Initial clauses : 310
% 0.15/0.95 % Removed in clause preprocessing : 0
% 0.15/0.95 % Initial clauses in saturation : 310
% 0.15/0.95 % Processed clauses : 3936
% 0.15/0.95 % ...of these trivial : 495
% 0.15/0.95 % ...subsumed : 368
% 0.15/0.95 % ...remaining for further processing : 3073
% 0.15/0.95 % Other redundant clauses eliminated : 2
% 0.15/0.95 % Clauses deleted for lack of memory : 0
% 0.15/0.95 % Backward-subsumed : 73
% 0.15/0.95 % Backward-rewritten : 36
% 0.15/0.95 % Generated clauses : 19160
% 0.15/0.95 % ...of the previous two non-redundant : 8376
% 0.15/0.95 % ...aggressively subsumed : 0
% 0.15/0.95 % Contextual simplify-reflections : 0
% 0.15/0.95 % Paramodulations : 19156
% 0.15/0.95 % Factorizations : 2
% 0.15/0.95 % NegExts : 0
% 0.15/0.95 % Equation resolutions : 2
% 0.15/0.95 % Disequality decompositions : 0
% 0.15/0.95 % Total rewrite steps : 16965
% 0.15/0.95 % ...of those cached : 16199
% 0.15/0.95 % Propositional unsat checks : 0
% 0.15/0.95 % Propositional check models : 0
% 0.15/0.95 % Propositional check unsatisfiable : 0
% 0.15/0.95 % Propositional clauses : 0
% 0.15/0.95 % Propositional clauses after purity: 0
% 0.15/0.95 % Propositional unsat core size : 0
% 0.15/0.95 % Propositional preprocessing time : 0.000
% 0.15/0.95 % Propositional encoding time : 0.000
% 0.15/0.95 % Propositional solver time : 0.000
% 0.15/0.95 % Success case prop preproc time : 0.000
% 0.15/0.95 % Success case prop encoding time : 0.000
% 0.15/0.95 % Success case prop solver time : 0.000
% 0.15/0.95 % Current number of processed clauses : 2962
% 0.15/0.95 % Positive orientable unit clauses : 1847
% 0.15/0.95 % Positive unorientable unit clauses: 0
% 0.15/0.95 % Negative unit clauses : 121
% 0.15/0.95 % Non-unit-clauses : 994
% 0.15/0.95 % Current number of unprocessed clauses: 4715
% 0.15/0.95 % ...number of literals in the above : 18045
% 0.15/0.95 % Current number of archived formulas : 0
% 0.15/0.95 % Current number of archived clauses : 109
% 0.15/0.95 % Clause-clause subsumption calls (NU) : 84592
% 0.15/0.95 % Rec. Clause-clause subsumption calls : 70637
% 0.15/0.95 % Non-unit clause-clause subsumptions : 355
% 0.15/0.95 % Unit Clause-clause subsumption calls : 27083
% 0.15/0.95 % Rewrite failures with RHS unbound : 0
% 0.15/0.95 % BW rewrite match attempts : 19295
% 0.15/0.95 % BW rewrite match successes : 48
% 0.15/0.95 % Condensation attempts : 0
% 0.15/0.95 % Condensation successes : 0
% 0.15/0.95 % Termbank termtop insertions : 213220
% 0.15/0.95 % Search garbage collected termcells : 1736
% 0.15/0.95
% 0.15/0.95 % -------------------------------------------------
% 0.15/0.95 % User time : 0.292 s
% 0.15/0.95 % System time : 0.021 s
% 0.15/0.95 % Total time : 0.313 s
% 0.15/0.95 % Maximum resident set size: 4852 pages
% 0.15/0.95
% 0.15/0.95 % -------------------------------------------------
% 0.15/0.95 % User time : 0.643 s
% 0.15/0.95 % System time : 0.119 s
% 0.15/0.95 % Total time : 0.763 s
% 0.15/0.95 % Maximum resident set size: 5120 pages
% 0.15/0.95 % E exiting
%------------------------------------------------------------------------------