0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.31 % Computer : n023.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % DateTime : Thu Jul 2 13:55:29 EDT 2020 0.11/0.31 % CPUTime : 0.72/1.04 ============================== Prover9 =============================== 0.72/1.04 Prover9 (32) version 2009-11A, November 2009. 0.72/1.04 Process 10754 was started by sandbox2 on n023.cluster.edu, 0.72/1.04 Thu Jul 2 13:55:29 2020 0.72/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_10601_n023.cluster.edu". 0.72/1.04 ============================== end of head =========================== 0.72/1.04 0.72/1.04 ============================== INPUT ================================= 0.72/1.04 0.72/1.04 % Reading from file /tmp/Prover9_10601_n023.cluster.edu 0.72/1.04 0.72/1.04 set(prolog_style_variables). 0.72/1.04 set(auto2). 0.72/1.04 % set(auto2) -> set(auto). 0.72/1.04 % set(auto) -> set(auto_inference). 0.72/1.04 % set(auto) -> set(auto_setup). 0.72/1.04 % set(auto_setup) -> set(predicate_elim). 0.72/1.04 % set(auto_setup) -> assign(eq_defs, unfold). 0.72/1.04 % set(auto) -> set(auto_limits). 0.72/1.04 % set(auto_limits) -> assign(max_weight, "100.000"). 0.72/1.04 % set(auto_limits) -> assign(sos_limit, 20000). 0.72/1.04 % set(auto) -> set(auto_denials). 0.72/1.04 % set(auto) -> set(auto_process). 0.72/1.04 % set(auto2) -> assign(new_constants, 1). 0.72/1.04 % set(auto2) -> assign(fold_denial_max, 3). 0.72/1.04 % set(auto2) -> assign(max_weight, "200.000"). 0.72/1.04 % set(auto2) -> assign(max_hours, 1). 0.72/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.72/1.04 % set(auto2) -> assign(max_seconds, 0). 0.72/1.04 % set(auto2) -> assign(max_minutes, 5). 0.72/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.72/1.04 % set(auto2) -> set(sort_initial_sos). 0.72/1.04 % set(auto2) -> assign(sos_limit, -1). 0.72/1.04 % set(auto2) -> assign(lrs_ticks, 3000). 0.72/1.04 % set(auto2) -> assign(max_megs, 400). 0.72/1.04 % set(auto2) -> assign(stats, some). 0.72/1.04 % set(auto2) -> clear(echo_input). 0.72/1.04 % set(auto2) -> set(quiet). 0.72/1.04 % set(auto2) -> clear(print_initial_clauses). 0.72/1.04 % set(auto2) -> clear(print_given). 0.72/1.04 assign(lrs_ticks,-1). 0.72/1.04 assign(sos_limit,10000). 0.72/1.04 assign(order,kbo). 0.72/1.04 set(lex_order_vars). 0.72/1.04 clear(print_given). 0.72/1.04 0.72/1.04 % formulas(sos). % not echoed (49 formulas) 0.72/1.04 0.72/1.04 ============================== end of input ========================== 0.72/1.04 0.72/1.04 % From the command line: assign(max_seconds, 960). 0.72/1.04 0.72/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.72/1.04 0.72/1.04 % Formulas that are not ordinary clauses: 0.72/1.04 1 (all B (bool(B) -> or1(true,B) = true)) # label(or1_axiom3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 2 (all B phi(B) = lazy_impl(true,B)) # label(lazy_impl_axiom3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 3 (all P all R f6(P,R) = lazy_impl(prop(R),impl(f5(P,R),R))) # label(def_f6) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 4 (all B lazy_and1(true,B) = phi(B)) # label(lazy_and1_axiom3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 5 (all B (bool(B) -> impl(true,B) = B)) # label(impl_axiom4) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 6 (all A (-bool(A) -> not1(A) = phi(A))) # label(not1_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 7 (all P exists R (exists2(P) = phi(f6(P,R)) & -(exists R1 forallprefers(f6(P,R1),f6(P,R))))) # label(def_exists2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 8 (all A all B (-bool(A) -> lazy_impl(A,B) = phi(A))) # label(lazy_impl_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 9 (all B (bool(B) -> and1(false,B) = false)) # label(and1_axiom3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 10 (all P all Q all R lazy_impl(prop(R),impl(impl(P,R),impl(impl(Q,R),R))) = f3(P,Q,R)) # label(def_f3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 11 (all A all B (-bool(B) & bool(A) -> or1(A,B) = phi(B))) # label(or1_axiom2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 12 (all X (-bool(X) <-> prop(X) = false)) # label(prop_false) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 13 (all B (bool(B) -> true = impl(false,B))) # label(impl_axiom3) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 14 (all P all X all R f4(P,X,R) = impl(apply(P,X),R)) # label(def_f4) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 15 (all A all B (-bool(B) & bool(A) -> impl(A,B) = phi(B))) # label(impl_axiom2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.04 16 (exists P (-(exists P1 forallprefers(f7(P1),f7(P))) & false2 = phi(f7(P)))) # label(def_false2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 17 (all P all Q all R lazy_impl(prop(R),impl(impl(P,impl(Q,R)),R)) = f1(P,Q,R)) # label(def_f1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 18 (all X all Y (existsprefers(X,Y) <-> X = true & Y = false | d(Y) & d(X) & bool(Y) & -bool(X) | d(Y) & -d(X))) # label(def_existsprefers) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 19 (all P exists X (-(exists X1 existsprefers(apply(P,X1),apply(P,X))) & exists1(P) = phi(apply(P,X)))) # label(exists1_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 20 (all X all Y (forallprefers(X,Y) <-> -d(X) & d(Y) | Y = true & X = false | d(Y) & d(X) & -bool(X) & bool(Y))) # label(def_forallprefers) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 21 (all X (phi(X) = err & -d(X) | d(X) & phi(X) = X)) # label(def_phi) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 22 (all B true = lazy_impl(false,B)) # label(lazy_impl_axiom2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 23 (all A all B (-bool(A) -> phi(A) = and1(A,B))) # label(and1_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 24 (all A all B (-bool(A) -> phi(A) = lazy_and1(A,B))) # label(lazy_and1_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 25 (all B (bool(B) -> B = and1(true,B))) # label(and1_axiom4) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 26 (all P all Q exists R (-(exists R1 forallprefers(f3(P,Q,R1),f3(P,Q,R))) & or2(P,Q) = phi(f3(P,Q,R)))) # label(def_or2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 27 (all A all B (-bool(A) -> phi(A) = or1(A,B))) # label(or1_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 28 (all P lazy_impl(prop(P),P) = f7(P)) # label(def_f7) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 29 (all A all B (-bool(A) -> phi(A) = impl(A,B))) # label(impl_axiom1) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 30 (all B false = lazy_and1(false,B)) # label(lazy_and1_axiom2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 31 (all P all Q all R f2(P,Q,R) = lazy_impl(prop(R),impl(lazy_impl(P,impl(Q,R)),R))) # label(def_f2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 32 (all P all Q exists R (phi(f2(P,Q,R)) = lazy_and2(P,Q) & -(exists R1 forallprefers(f2(P,Q,R1),f2(P,Q,R))))) # label(def_lazy_and2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 33 (all P all R exists X (-(exists X1 forallprefers(f4(P,X1,R),f4(P,X,R))) & f5(P,R) = phi(f4(P,X,R)))) # label(def_f5) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 34 (all B (bool(B) -> B = or1(false,B))) # label(or1_axiom4) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 35 (all P impl(P,false2) = not2(P)) # label(def_not2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 36 (all X (false = X | X = true <-> bool(X))) # label(def_bool) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 37 (all A all B (bool(A) & -bool(B) -> phi(B) = and1(A,B))) # label(and1_axiom2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 38 (all P all Q exists R (-(exists R1 forallprefers(f1(P,Q,R1),f1(P,Q,R))) & phi(f1(P,Q,R)) = and2(P,Q))) # label(def_and2) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 39 (all X (bool(X) <-> true = prop(X))) # label(prop_true) # label(axiom) # label(non_clause). [assumption]. 0.72/1.05 40 -(all P all Q and1(P,Q) = and2(P,Q)) # label(and1_and2) # label(negated_conjecture) # label(non_clause). [assumption]. 0.72/1.05 0.72/1.05 ============================== end of process non-clausal formulas === 0.72/1.05 0.72/1.05 ============================== PROCESS INITIAL CLAUSES =============== 0.72/1.05 0.72/1.05 ============================== PREDICATE ELIMINATION ================= 0.72/1.05 0.72/1.05 ============================== end predicate elimination ============= 0.72/1.05 0.72/1.05 Auto_denials: (non-Horn, no changes). 0.72/1.05 0.72/1.05 Term ordering decisions: 0.72/1.05 Function symbol KB weights: true=1. false=1. err=1. false2=1. false1=1. c1=1. c2=1. c3=1. impl=1. lazy_impl=1. and1=1. or1=1. lazy_and1=1. apply=1. f5=1. f6=1. and2=1. lazy_and2=1. or2=1. f3=1. f4=1. f7=1. f8=1. phi=1. prop=1. not1=1. f7=1. exists1=1. exists2=1. not2=1. f1=1. f2=1. f1=1. f2=1. f3=1. f4=1. 0.72/1.05 0.72/1.05 ============================== end of pAlarm clock 119.65/120.07 Prover9 interrupted 119.65/120.07 EOF