0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n018.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 1440 0.14/0.34 % WCLimit : 180 0.14/0.34 % DateTime : Mon Jul 3 06:55:15 EDT 2023 0.14/0.34 % CPUTime : 0.44/1.01 ============================== Prover9 =============================== 0.44/1.01 Prover9 (32) version 2009-11A, November 2009. 0.44/1.01 Process 29202 was started by sandbox on n018.cluster.edu, 0.44/1.01 Mon Jul 3 06:55:16 2023 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_29049_n018.cluster.edu". 0.44/1.01 ============================== end of head =========================== 0.44/1.01 0.44/1.01 ============================== INPUT ================================= 0.44/1.01 0.44/1.01 % Reading from file /tmp/Prover9_29049_n018.cluster.edu 0.44/1.01 0.44/1.01 set(prolog_style_variables). 0.44/1.01 set(auto2). 0.44/1.01 % set(auto2) -> set(auto). 0.44/1.01 % set(auto) -> set(auto_inference). 0.44/1.01 % set(auto) -> set(auto_setup). 0.44/1.01 % set(auto_setup) -> set(predicate_elim). 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.44/1.01 % set(auto) -> set(auto_limits). 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.44/1.01 % set(auto) -> set(auto_denials). 0.44/1.01 % set(auto) -> set(auto_process). 0.44/1.01 % set(auto2) -> assign(new_constants, 1). 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.44/1.01 % set(auto2) -> assign(max_hours, 1). 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.44/1.01 % set(auto2) -> assign(max_seconds, 0). 0.44/1.01 % set(auto2) -> assign(max_minutes, 5). 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.44/1.01 % set(auto2) -> set(sort_initial_sos). 0.44/1.01 % set(auto2) -> assign(sos_limit, -1). 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.44/1.01 % set(auto2) -> assign(max_megs, 400). 0.44/1.01 % set(auto2) -> assign(stats, some). 0.44/1.01 % set(auto2) -> clear(echo_input). 0.44/1.01 % set(auto2) -> set(quiet). 0.44/1.01 % set(auto2) -> clear(print_initial_clauses). 0.44/1.01 % set(auto2) -> clear(print_given). 0.44/1.01 assign(lrs_ticks,-1). 0.44/1.01 assign(sos_limit,10000). 0.44/1.01 assign(order,kbo). 0.44/1.01 set(lex_order_vars). 0.44/1.01 clear(print_given). 0.44/1.01 0.44/1.01 % formulas(sos). % not echoed (20 formulas) 0.44/1.01 0.44/1.01 ============================== end of input ========================== 0.44/1.01 0.44/1.01 % From the command line: assign(max_seconds, 1440). 0.44/1.01 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.44/1.01 0.44/1.01 % Formulas that are not ordinary clauses: 0.44/1.01 1 (all X all Y (smaller_or_equal(X,Y) <-> X = Y | smaller(X,Y))) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | Y = X)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 3 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 5 (all X all Y (greater(Y,X) <-> smaller(X,Y))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 6 (all X all Y (greater(X,Y) | X = Y | smaller(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 7 (all X all T (organization(X) -> (-has_immunity(X,T) -> (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-positional_advantage(X,T) & -is_aligned(X,T) -> hazard_of_mortality(X,T) = high) & (-is_aligned(X,T) & positional_advantage(X,T) -> mod1 = hazard_of_mortality(X,T)) & (positional_advantage(X,T) & is_aligned(X,T) -> low = hazard_of_mortality(X,T))) & (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 8 (all X all T (organization(X) & zero = age(X,T) -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 9 (all X (robust_position(X) <-> (all T ((greater(age(X,T),tau) -> positional_advantage(X,T)) & (smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 10 (all X all T (-has_endowment(X) & organization(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 11 (all X all T0 all T (-(is_aligned(X,T0) <-> is_aligned(X,T)) & organization(X) <-> dissimilar(X,T0,T))) # label(definition_2) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 12 (all X (has_endowment(X) <-> (all T (organization(X) & (smaller_or_equal(age(X,T),eta) -> has_immunity(X,T)) & (greater(age(X,T),eta) -> -has_immunity(X,T)))))) # label(definition_1) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 13 (all X all T0 all T (zero = age(X,T0) & organization(X) -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption]. 0.44/1.01 14 -(all X all T0 all T1 all T2 all T3 (robust_position(X) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T3),tau) & smaller_or_equal(age(X,T2),tau) & greater(age(X,T2),sigma) & smaller(sigma,tau) & greater(tau,zero) & greater(sigma,zero) & age(X,T0) = zero & -has_endowment(X) & organization(X) -> smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0) & smaller(hazard_of_mortality(X,T1),hazard_of_mortality(X,T2)))) # label(theorem_9) # label(negated_conjecture) # label(non_clause). [assumption]. 0.44/1.01 0.44/1.01 ============================== end of process non-clausal formulas === 0.44/1.01 0.44/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.44/1.01 0.44/1.01 ============================== PREDICATE ELIMINATION ================= 0.44/1.01 15 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(9)]. 0.44/1.01 16 robust_position(c1) # label(theorem_9) # label(negated_conjecture). [clausify(14)]. 0.44/1.01 17 robust_position(A) | greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)) # label(definition_4) # label(axiom). [clausify(9)]. 0.44/1.01 18 robust_position(A) | greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau) # label(definition_4) # label(axiom). [clausify(9)]. 0.44/1.01 Derived: -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A). [resolve(15,a,16,a)]. 0.44/1.01 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)). [resolve(15,a,17,a)]. 0.44/1.01 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau). [resolve(15,a,18,a)]. 0.44/1.01 19 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(9)]. 0.44/1.01 Derived: -greater(age(c1,A),tau) | positional_advantage(c1,A). [resolve(19,a,16,a)]. 0.44/1.01 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f1(A)),tau) | positional_advantage(A,f1(A)). [resolve(19,a,17,a)]. 0.44/1.01 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | greater(age(A,f1(A)),tau) | smaller_or_equal(age(A,f1(A)),tau). [resolve(19,a,18,a)]. 0.44/1.01 20 robust_position(A) | -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) # label(definition_4) # label(axiom). [clausify(9)]. 0.44/1.01 Derived: -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(20,a,15,a)]. 0.44/1.01 Derived: -positional_advantage(A,f1(A)) | smaller_or_equal(age(A,f1(A)),tau) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(20,a,19,a)]. 0.44/1.01 21 has_endowment(A) | -organization(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(10)]. 0.44/1.01 22 organization(c1) # label(theorem_9) # label(negated_conjecture). [clausify(14)]. 0.44/1.01 23 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(12)]. 0.44/1.01 24 organization(A) | -dissimilar(A,B,C) # label(definition_2) # label(axiom). [clausify(11)]. 0.44/1.01 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(21,b,22,a)]. 0.44/1.01 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(21,b,24,a)]. 0.44/1.01 25 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(7)]. 0.44/1.01 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(25,a,22,a)]. 0.44/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(25,a,23,b)]. 0.44/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(25,a,24,a)]. 0.44/1.01 26 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(8)]. 0.44/1.01 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(26,a,22,a)]. 0.44/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(26,a,23,b)]. 0.44/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(26,a,24,a)]. 0.44/1.01 27 -is_aligned(A,B) | is_aligned(A,C) | -organization(A) | dissimilar(A,B,C) # label(definition_2) # label(axiom). [clausify(11)]. 0.44/1.01 Derived: -is_aligned(c1,A) | is_aligned(c1,B) | dissimilar(c1,A,B). [resolve(27,c,22,a)]. 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(27,c,23,b)]. 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(27,c,24,a)]. 0.44/1.01 28 is_aligned(A,B) | -is_aligned(A,C) | -organization(A) | dissimilar(A,B,C) # label(definition_2) # label(axiom). [clausify(11)]. 0.44/1.01 Derived: is_aligned(c1,A) | -is_aligned(c1,B) | dissimilar(c1,A,B). [resolve(28,c,22,a)]. 0.44/1.01 Derived: is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(28,c,23,b)]. 0.44/1.01 Derived: is_aligned(A,B) | -is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(28,c,24,a)]. 0.44/1.01 29 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f2(A)),eta) | has_immunity(A,f2(A)) # label(definition_1) # label(axiom). [clausify(12)]. 0.44/1.01 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f2(c1)),eta) | has_immunity(c1,f2(c1)). [resolve(29,b,22,a)]. 0.44/1.01 Derived: has_endowment(A) | smaller_or_equal(age(A,f2(A)),eta) | has_immunity(A,f2(A)) | -dissimilar(A,B,C). [resolve(29,b,24,a)]. 0.44/1.01 30 has_endowment(A) | -organization(A) | -has_immunity(A,f2(A)) | greater(age(A,f2(A)),eta) # label(definition_1) # label(axiom). [clausify(12)]. 0.44/1.01 31 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(7)]. 0.44/1.01 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(31,a,22,a)]. 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(31,a,23,b)]. 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(31,a,24,a)]. 0.44/1.01 32 -organization(A) | has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(7)]. 0.44/1.01 Derived: has_immunity(c1,A) | positional_advantage(c1,A) | is_aligned(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(32,a,22,a)]. 0.44/1.01 Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(32,a,23,b)]. 0.44/1.01 Derived: has_immunity(A,B) | positional_advantage(A,B) | is_aligned(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(32,a,24,a)]. 0.44/1.01 33 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(7)]. 0.44/1.01 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(33,a,22,a)]. 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(33,a,23,b)]. 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(33,a,24,a)]. 0.44/1.01 34 -organization(A) | has_immunity(A,B) | -positional_advantage(A,B) | -is_aligned(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(7)]. 0.44/1.01 Derived: has_immunity(c1,A) | -positional_advantage(c1,A) | -is_aligned(c1,A) | hazard_of_mortality(c1,A) = low. Alarm clock 179.81/180.08 Prover9 interrupted 179.81/180.08 EOF