0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n021.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 : 180 0.14/0.34 % DateTime : Thu Aug 29 15:13:34 EDT 2019 0.14/0.34 % CPUTime : 0.47/0.99 ============================== Prover9 =============================== 0.47/0.99 Prover9 (32) version 2009-11A, November 2009. 0.47/0.99 Process 10552 was started by sandbox2 on n021.cluster.edu, 0.47/0.99 Thu Aug 29 15:13:34 2019 0.47/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_10398_n021.cluster.edu". 0.47/0.99 ============================== end of head =========================== 0.47/0.99 0.47/0.99 ============================== INPUT ================================= 0.47/0.99 0.47/0.99 % Reading from file /tmp/Prover9_10398_n021.cluster.edu 0.47/0.99 0.47/0.99 set(prolog_style_variables). 0.47/0.99 set(auto2). 0.47/0.99 % set(auto2) -> set(auto). 0.47/0.99 % set(auto) -> set(auto_inference). 0.47/0.99 % set(auto) -> set(auto_setup). 0.47/0.99 % set(auto_setup) -> set(predicate_elim). 0.47/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.47/0.99 % set(auto) -> set(auto_limits). 0.47/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.47/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.47/0.99 % set(auto) -> set(auto_denials). 0.47/0.99 % set(auto) -> set(auto_process). 0.47/0.99 % set(auto2) -> assign(new_constants, 1). 0.47/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.47/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.47/0.99 % set(auto2) -> assign(max_hours, 1). 0.47/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.47/0.99 % set(auto2) -> assign(max_seconds, 0). 0.47/0.99 % set(auto2) -> assign(max_minutes, 5). 0.47/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.47/0.99 % set(auto2) -> set(sort_initial_sos). 0.47/0.99 % set(auto2) -> assign(sos_limit, -1). 0.47/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.47/0.99 % set(auto2) -> assign(max_megs, 400). 0.47/0.99 % set(auto2) -> assign(stats, some). 0.47/0.99 % set(auto2) -> clear(echo_input). 0.47/0.99 % set(auto2) -> set(quiet). 0.47/0.99 % set(auto2) -> clear(print_initial_clauses). 0.47/0.99 % set(auto2) -> clear(print_given). 0.47/0.99 assign(lrs_ticks,-1). 0.47/0.99 assign(sos_limit,10000). 0.47/0.99 assign(order,kbo). 0.47/0.99 set(lex_order_vars). 0.47/0.99 clear(print_given). 0.47/0.99 0.47/0.99 % formulas(sos). % not echoed (43 formulas) 0.47/0.99 0.47/0.99 ============================== end of input ========================== 0.47/0.99 0.47/0.99 % From the command line: assign(max_seconds, 180). 0.47/0.99 0.47/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.47/0.99 0.47/0.99 % Formulas that are not ordinary clauses: 0.47/0.99 1 (all X all Y is_a_theorem(implies(X,implies(Y,and(X,Y))))) <-> and_3 # label(and_3) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 2 r5 <-> (all P all Q all R is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))) # label(r5) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 3 substitution_of_equivalents <-> (all X all Y (is_a_theorem(equiv(X,Y)) -> X = Y)) # label(substitution_of_equivalents) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 4 (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))) <-> kn3 # label(kn3) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 5 implies_3 <-> (all X all Y all Z is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))) # label(implies_3) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 6 cn1 <-> (all P all Q all R is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))) # label(cn1) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 7 (all X all Y is_a_theorem(implies(equiv(X,Y),implies(X,Y)))) <-> equivalence_1 # label(equivalence_1) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 8 (all X all Y is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))) <-> equivalence_3 # label(equivalence_3) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 9 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]. 0.47/0.99 10 (all P is_a_theorem(implies(P,and(P,P)))) <-> kn1 # label(kn1) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 11 (all X all Y is_a_theorem(implies(and(X,Y),X))) <-> and_1 # label(and_1) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 12 and_2 <-> (all X all Y is_a_theorem(implies(and(X,Y),Y))) # label(and_2) # label(axiom) # label(non_clause). [assumption]. 0.47/0.99 13 (all P is_a_theorem(implies(implies(not(P),P),P))) <-> cn3 # label(cn3) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 14 or_2 <-> (all X all Y is_a_theorem(implies(Y,or(X,Y)))) # label(or_2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 15 r3 <-> (all P all Q is_a_theorem(implies(or(P,Q),or(Q,P)))) # label(r3) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 16 (all P all Q is_a_theorem(implies(P,implies(not(P),Q)))) <-> cn2 # label(cn2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 17 implies_2 <-> (all X all Y is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))) # label(implies_2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 18 (all P all Q is_a_theorem(implies(Q,or(P,Q)))) <-> r2 # label(r2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 19 (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]. 1.12/1.41 20 (all X all Y is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))) <-> modus_tollens # label(modus_tollens) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 21 equivalence_2 <-> (all X all Y is_a_theorem(implies(equiv(X,Y),implies(Y,X)))) # label(equivalence_2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 22 implies_1 <-> (all X all Y is_a_theorem(implies(X,implies(Y,X)))) # label(implies_1) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 23 or_1 <-> (all X all Y is_a_theorem(implies(X,or(X,Y)))) # label(or_1) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 24 (all P all Q all R is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R))))) <-> r4 # label(r4) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 25 r1 <-> (all P is_a_theorem(implies(or(P,P),P))) # label(r1) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 26 kn2 <-> (all P all Q is_a_theorem(implies(and(P,Q),P))) # label(kn2) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 27 op_and -> (all X all Y not(or(not(X),not(Y))) = and(X,Y)) # label(op_and) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 28 op_or -> (all X all Y or(X,Y) = not(and(not(X),not(Y)))) # label(op_or) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 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.12/1.41 30 op_implies_or -> (all X all Y implies(X,Y) = or(not(X),Y)) # label(op_implies_or) # label(axiom) # label(non_clause). [assumption]. 1.12/1.41 31 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.12/1.41 1.12/1.41 ============================== end of process non-clausal formulas === 1.12/1.41 1.12/1.41 ============================== PROCESS INITIAL CLAUSES =============== 1.12/1.41 1.12/1.41 ============================== PREDICATE ELIMINATION ================= 1.12/1.41 1.12/1.41 ============================== end predicate elimination ============= 1.12/1.41 1.12/1.41 Auto_denials: (non-Horn, no changes). 1.12/1.41 1.12/1.41 Term ordering decisions: 1.12/1.41 1.12/1.41 % Assigning unary symbol not kb_weight 0 and highest precedence (93). 1.12/1.41 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.12/1.41 1.12/1.41 ============================== end of process initial clauses ======== 1.12/1.41 1.12/1.41 ============================== CLAUSES FOR SEARCH ==================== 1.12/1.41 1.12/1.41 ============================== end of clauses for search ============= 1.12/1.41 1.12/1.41 ============================== SEARCH ================================ 1.12/1.41 1.12/1.41 % Starting search at 0.02 seconds. 1.12/1.41 1.12/1.41 Low Water (keep): wt=38.000, iters=3402 1.12/1.41 1.12/1.41 Low Water (keep): wt=36.000, iters=3350 1.12/1.41 1.12/1.41 Low Water (keep): wt=35.000, iters=3364 1.12/1.41 1.12/1.41 Low Water (keep): wt=34.000, iters=3398 1.12/1.41 1.12/1.41 Low Water (keep): wt=30.000, iters=3345 1.12/1.41 1.12/1.41 Low Water (keep): wt=29.000, iters=3384 1.12/1.41 1.12/1.41 Low Water (keep): wt=28.000, iters=3370 1.12/1.41 1.12/1.41 Low Water (keep): wt=27.000, iters=3558 1.12/1.41 1.12/1.41 Low Water (keep): wt=26.000, iters=3471 1.12/1.41 1.12/1.41 Low Water (keep): wt=25.000, iters=3377Cputime limit exceeded (core dumped) 180.07/180.34 EOF