0.04/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.35 % Computer : n021.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Aug 9 04:07:50 EDT 2022 0.13/0.35 % CPUTime : 0.84/1.16 ============================== Prover9 =============================== 0.84/1.16 Prover9 (32) version 2009-11A, November 2009. 0.84/1.16 Process 1187 was started by sandbox2 on n021.cluster.edu, 0.84/1.16 Tue Aug 9 04:07:51 2022 0.84/1.16 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_1003_n021.cluster.edu". 0.84/1.16 ============================== end of head =========================== 0.84/1.16 0.84/1.16 ============================== INPUT ================================= 0.84/1.16 0.84/1.16 % Reading from file /tmp/Prover9_1003_n021.cluster.edu 0.84/1.16 0.84/1.16 set(prolog_style_variables). 0.84/1.16 set(auto2). 0.84/1.16 % set(auto2) -> set(auto). 0.84/1.16 % set(auto) -> set(auto_inference). 0.84/1.16 % set(auto) -> set(auto_setup). 0.84/1.16 % set(auto_setup) -> set(predicate_elim). 0.84/1.16 % set(auto_setup) -> assign(eq_defs, unfold). 0.84/1.16 % set(auto) -> set(auto_limits). 0.84/1.16 % set(auto_limits) -> assign(max_weight, "100.000"). 0.84/1.16 % set(auto_limits) -> assign(sos_limit, 20000). 0.84/1.16 % set(auto) -> set(auto_denials). 0.84/1.16 % set(auto) -> set(auto_process). 0.84/1.16 % set(auto2) -> assign(new_constants, 1). 0.84/1.16 % set(auto2) -> assign(fold_denial_max, 3). 0.84/1.16 % set(auto2) -> assign(max_weight, "200.000"). 0.84/1.16 % set(auto2) -> assign(max_hours, 1). 0.84/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.84/1.16 % set(auto2) -> assign(max_seconds, 0). 0.84/1.16 % set(auto2) -> assign(max_minutes, 5). 0.84/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.84/1.16 % set(auto2) -> set(sort_initial_sos). 0.84/1.16 % set(auto2) -> assign(sos_limit, -1). 0.84/1.16 % set(auto2) -> assign(lrs_ticks, 3000). 0.84/1.16 % set(auto2) -> assign(max_megs, 400). 0.84/1.16 % set(auto2) -> assign(stats, some). 0.84/1.16 % set(auto2) -> clear(echo_input). 0.84/1.16 % set(auto2) -> set(quiet). 0.84/1.16 % set(auto2) -> clear(print_initial_clauses). 0.84/1.16 % set(auto2) -> clear(print_given). 0.84/1.16 assign(lrs_ticks,-1). 0.84/1.16 assign(sos_limit,10000). 0.84/1.16 assign(order,kbo). 0.84/1.16 set(lex_order_vars). 0.84/1.16 clear(print_given). 0.84/1.16 0.84/1.16 % formulas(sos). % not echoed (19 formulas) 0.84/1.16 0.84/1.16 ============================== end of input ========================== 0.84/1.16 0.84/1.16 % From the command line: assign(max_seconds, 960). 0.84/1.16 0.84/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.84/1.16 0.84/1.16 % Formulas that are not ordinary clauses: 0.84/1.16 1 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 2 (all X11 exists Y21 all X12 (r2(X11,X12) & id(X12,Y21) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 3 (exists Y24 all X19 (-id(X19,Y24) & -r1(X19) | r1(X19) & id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 4 (all X16 all X17 exists Y23 all X18 (id(X18,Y23) & r4(X16,X17,X18) | -id(X18,Y23) & -r4(X16,X17,X18))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 5 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | -id(Y13,Y12))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 6 (all X6 ((exists Y19 (id(X6,Y19) & r1(Y19))) | (exists Y1 exists Y11 (id(X6,Y11) & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 7 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & -id(X15,Y22) | id(X15,Y22) & r3(X13,X14,X15))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 8 (all X4 exists Y9 ((exists Y16 (r3(X4,Y16,Y9) & r1(Y16))) & id(Y9,X4))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 9 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 10 (all X7 all Y10 (-r2(X7,Y10) | (all Y20 (-id(Y20,Y10) | -r1(Y20))))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 11 (all X1 all X8 exists Y4 ((exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 12 (all X32 all X33 all X34 all X35 all X36 all X37 (-r3(X35,X36,X37) & -r3(X32,X33,X34) | r3(X35,X36,X37) & r3(X32,X33,X34) | -id(X34,X37) | -id(X33,X36) | -id(X32,X35))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption]. 0.84/1.16 13 (all X2 all X9 exists Y2 ((exists YAlarm clock 119.35/120.12 Prover9 interrupted 119.35/120.12 EOF