0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.34 % Computer : n019.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 07:38:51 EDT 2022 0.12/0.34 % CPUTime : 0.83/1.14 ============================== Prover9 =============================== 0.83/1.14 Prover9 (32) version 2009-11A, November 2009. 0.83/1.14 Process 19536 was started by sandbox2 on n019.cluster.edu, 0.83/1.14 Tue Aug 9 07:38:52 2022 0.83/1.14 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_19367_n019.cluster.edu". 0.83/1.14 ============================== end of head =========================== 0.83/1.14 0.83/1.14 ============================== INPUT ================================= 0.83/1.14 0.83/1.14 % Reading from file /tmp/Prover9_19367_n019.cluster.edu 0.83/1.14 0.83/1.14 set(prolog_style_variables). 0.83/1.14 set(auto2). 0.83/1.14 % set(auto2) -> set(auto). 0.83/1.14 % set(auto) -> set(auto_inference). 0.83/1.14 % set(auto) -> set(auto_setup). 0.83/1.14 % set(auto_setup) -> set(predicate_elim). 0.83/1.14 % set(auto_setup) -> assign(eq_defs, unfold). 0.83/1.14 % set(auto) -> set(auto_limits). 0.83/1.14 % set(auto_limits) -> assign(max_weight, "100.000"). 0.83/1.14 % set(auto_limits) -> assign(sos_limit, 20000). 0.83/1.14 % set(auto) -> set(auto_denials). 0.83/1.14 % set(auto) -> set(auto_process). 0.83/1.14 % set(auto2) -> assign(new_constants, 1). 0.83/1.14 % set(auto2) -> assign(fold_denial_max, 3). 0.83/1.14 % set(auto2) -> assign(max_weight, "200.000"). 0.83/1.14 % set(auto2) -> assign(max_hours, 1). 0.83/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.83/1.14 % set(auto2) -> assign(max_seconds, 0). 0.83/1.14 % set(auto2) -> assign(max_minutes, 5). 0.83/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.83/1.14 % set(auto2) -> set(sort_initial_sos). 0.83/1.14 % set(auto2) -> assign(sos_limit, -1). 0.83/1.14 % set(auto2) -> assign(lrs_ticks, 3000). 0.83/1.14 % set(auto2) -> assign(max_megs, 400). 0.83/1.14 % set(auto2) -> assign(stats, some). 0.83/1.14 % set(auto2) -> clear(echo_input). 0.83/1.14 % set(auto2) -> set(quiet). 0.83/1.14 % set(auto2) -> clear(print_initial_clauses). 0.83/1.14 % set(auto2) -> clear(print_given). 0.83/1.14 assign(lrs_ticks,-1). 0.83/1.14 assign(sos_limit,10000). 0.83/1.14 assign(order,kbo). 0.83/1.14 set(lex_order_vars). 0.83/1.14 clear(print_given). 0.83/1.14 0.83/1.14 % formulas(sos). % not echoed (43 formulas) 0.83/1.14 0.83/1.14 ============================== end of input ========================== 0.83/1.14 0.83/1.14 % From the command line: assign(max_seconds, 960). 0.83/1.14 0.83/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.83/1.14 0.83/1.14 % Formulas that are not ordinary clauses: 0.83/1.14 1 and_1 <-> (all X all Y is_a_theorem(implies(and(X,Y),X))) # label(and_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 2 modus_tollens <-> (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) # label(modus_tollens) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 3 (all X all Y is_a_theorem(implies(and(X,Y),Y))) <-> and_2 # label(and_2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 4 (all X all Y all Z is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))) <-> or_3 # label(or_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 5 and_3 <-> (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) # label(and_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 6 equivalence_3 <-> (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) # label(equivalence_3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 7 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 8 kn3 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) # label(kn3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 9 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 10 cn3 <-> (all P is_a_theorem(implies(implies(not(P),P),P))) # label(cn3) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 11 (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) <-> cn1 # label(cn1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 12 equivalence_1 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) # label(equivalence_1) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 13 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> Y = X)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption]. 0.83/1.14 14 (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) <-> r5 # label(r5) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 15 (all P all Q is_a_theorem(implies(Q,or(P,Q)))) <-> r2 # label(r2) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 16 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 17 (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) <-> cn2 # label(cn2) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 18 (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) <-> implies_2 # label(implies_2) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 19 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 20 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 21 r4 <-> (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) # label(r4) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 22 (all P is_a_theorem(implies(P,and(P,P)))) <-> kn1 # label(kn1) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 23 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) <-> equivalence_2 # label(equivalence_2) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 24 modus_ponens <-> (all X all Y (is_a_theorem(X) & is_a_theorem(implies(X,Y)) -> is_a_theorem(Y))) # label(modus_ponens) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 25 (all X all Y is_a_theorem(implies(X,implies(Y,X)))) <-> implies_1 # label(implies_1) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 26 (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) <-> implies_3 # label(implies_3) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 27 op_implies_and -> (all X all Y implies(X,Y) = not(and(X,not(Y)))) # label(op_implies_and) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 28 op_implies_or -> (all X all Y or(not(X),Y) = implies(X,Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 29 op_equiv -> (all X all Y equiv(X,Y) = and(implies(X,Y),implies(Y,X))) # label(op_equiv) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 30 op_or -> (all X all Y not(and(not(X),not(Y))) = or(X,Y)) # label(op_or) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 31 op_and -> (all X all Y and(X,Y) = not(or(not(X),not(Y)))) # label(op_and) # label(axiom) # label(non_clause). [assumption]. 1.47/1.75 1.47/1.75 ============================== end of process non-clausal formulas === 1.47/1.75 1.47/1.75 ============================== PROCESS INITIAL CLAUSES =============== 1.47/1.75 1.47/1.75 ============================== PREDICATE ELIMINATION ================= 1.47/1.75 1.47/1.75 ============================== end predicate elimination ============= 1.47/1.75 1.47/1.75 Auto_denials: (non-Horn, no changes). 1.47/1.75 1.47/1.75 Term ordering decisions: 1.47/1.75 1.47/1.75 % Assigning unary symbol not kb_weight 0 and highest precedence (94). 1.47/1.75 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. c37=1. c38=1. c39=1. c40=1. c41=1. c42=1. c43=1. c44=1. c45=1. c46=1. c47=1. c48=1. c49=1. c50=1. c51=1. c52=1. c53=1. c54=1. c55=1. implies=1. or=1. and=1. equiv=1. not=0. 1.47/1.75 1.47/1.75 ============================== end of process initial clauses ======== 1.47/1.75 1.47/1.75 ============================== CLAUSES FOR SEARCH ==================== 1.47/1.75 1.47/1.75 ============================== end of clauses for search ============= 1.47/1.75 1.47/1.75 ============================== SEARCH ================================ 1.47/1.75 1.47/1.75 % Starting search at 0.02 seconds. 1.47/1.75 1.47/1.75 Low Water (keep): wt=107.000, iters=3420 1.47/1.75 1.47/1.75 Low Water (keep): wt=53.000, iters=3402 1.47/1.75 1.47/1.75 Low Water (keep): wt=47.000, iters=3344 1.47/1.75 1.47/1.75 Low Water (keep): wt=42.000, iters=3461 1.47/1.75 1.47/1.75 Low Water (keep): wt=37.000, iters=3342 1.47/1.75 1.47/1.75 Low Water (keep): wt=36.000, iters=3351 1.47/1.75 1.47/1.75 Low Water (keep): wt=35.000, iters=3341 1.47/1.75 1.47/1.75 Low Water (keep): wt=33.000, iters=3520 1.47/1.75 1.47/1.75 Low Water (keep): wt=31.000, iters=3425 1.47/1.75 1.47/1.75 Low Water (keep): wt=27.000, iters=338Alarm clock 119.51/120.10 Prover9 interrupted 119.51/120.10 EOF