0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n013.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 180 0.13/0.34 % DateTime : Thu Aug 29 10:57:16 EDT 2019 0.13/0.34 % CPUTime : 3.32/3.67 ============================== Prover9 =============================== 3.32/3.67 Prover9 (32) version 2009-11A, November 2009. 3.32/3.67 Process 9272 was started by sandbox on n013.cluster.edu, 3.32/3.67 Thu Aug 29 10:57:17 2019 3.32/3.67 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_9115_n013.cluster.edu". 3.32/3.67 ============================== end of head =========================== 3.32/3.67 3.32/3.67 ============================== INPUT ================================= 3.32/3.67 3.32/3.67 % Reading from file /tmp/Prover9_9115_n013.cluster.edu 3.32/3.67 3.32/3.67 set(prolog_style_variables). 3.32/3.67 set(auto2). 3.32/3.67 % set(auto2) -> set(auto). 3.32/3.67 % set(auto) -> set(auto_inference). 3.32/3.67 % set(auto) -> set(auto_setup). 3.32/3.67 % set(auto_setup) -> set(predicate_elim). 3.32/3.67 % set(auto_setup) -> assign(eq_defs, unfold). 3.32/3.67 % set(auto) -> set(auto_limits). 3.32/3.67 % set(auto_limits) -> assign(max_weight, "100.000"). 3.32/3.67 % set(auto_limits) -> assign(sos_limit, 20000). 3.32/3.67 % set(auto) -> set(auto_denials). 3.32/3.67 % set(auto) -> set(auto_process). 3.32/3.67 % set(auto2) -> assign(new_constants, 1). 3.32/3.67 % set(auto2) -> assign(fold_denial_max, 3). 3.32/3.67 % set(auto2) -> assign(max_weight, "200.000"). 3.32/3.67 % set(auto2) -> assign(max_hours, 1). 3.32/3.67 % assign(max_hours, 1) -> assign(max_seconds, 3600). 3.32/3.67 % set(auto2) -> assign(max_seconds, 0). 3.32/3.67 % set(auto2) -> assign(max_minutes, 5). 3.32/3.67 % assign(max_minutes, 5) -> assign(max_seconds, 300). 3.32/3.67 % set(auto2) -> set(sort_initial_sos). 3.32/3.67 % set(auto2) -> assign(sos_limit, -1). 3.32/3.67 % set(auto2) -> assign(lrs_ticks, 3000). 3.32/3.67 % set(auto2) -> assign(max_megs, 400). 3.32/3.67 % set(auto2) -> assign(stats, some). 3.32/3.67 % set(auto2) -> clear(echo_input). 3.32/3.67 % set(auto2) -> set(quiet). 3.32/3.67 % set(auto2) -> clear(print_initial_clauses). 3.32/3.67 % set(auto2) -> clear(print_given). 3.32/3.67 assign(lrs_ticks,-1). 3.32/3.67 assign(sos_limit,10000). 3.32/3.67 assign(order,kbo). 3.32/3.67 set(lex_order_vars). 3.32/3.67 clear(print_given). 3.32/3.67 3.32/3.67 % formulas(sos). % not echoed (5 formulas) 3.32/3.67 3.32/3.67 ============================== end of input ========================== 3.32/3.67 3.32/3.67 % From the command line: assign(max_seconds, 180). 3.32/3.67 3.32/3.67 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 3.32/3.67 3.32/3.67 % Formulas that are not ordinary clauses: 3.32/3.67 1 (all X_2 all X_1 (g_false(X_2,X_1) & -g_true(X_2,X_1) <-> g_false_only(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption]. 3.32/3.67 2 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_both(X_2,X_1) | g_false_only(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause). [assumption]. 3.32/3.67 3 (all X_2 all X_1 (g_both(X_2,X_1) <-> g_true(X_2,X_1) & g_false(X_2,X_1))) # label(both_g) # label(axiom) # label(non_clause). [assumption]. 3.32/3.67 4 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> -g_false(X_2,X_1) & g_true(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption]. 3.32/3.67 5 -((all A exists B (((exists C ((g_both(B,C) | g_both(C,B)) & -g_false_only(B,C) & -g_false_only(C,B))) & -(exists C (g_true_only(C,B) & g_true_only(B,C))) | (exists C (g_true_only(B,C) & g_true_only(C,B)))) & g_true_only(B,A) | g_both(B,A) & ((all C (g_false_only(B,C) | g_false_only(C,B))) | (exists C (g_true_only(C,B) & g_true_only(B,C)))) | g_false_only(B,A) & ((exists C ((g_both(C,B) | g_both(B,C)) & -g_false_only(B,C) & -g_false_only(C,B))) & -(exists C (g_true_only(B,C) & g_true_only(C,B))) | (all C (g_false_only(B,C) | g_false_only(C,B)))))) | -(exists A all B ((all C (g_false_only(C,B) | g_false_only(B,C))) & g_true_only(B,A) | g_false_only(B,A) & (exists C (g_true_only(C,B) & g_true_only(B,C))))) & (exists A ((exists B ((exists C (-g_false_only(B,C) & -g_false_only(C,B) & (g_both(C,B) | g_both(B,C)))) & -(exists C (g_true_only(B,C) & g_true_only(C,B))) & g_both(B,A))) & -(exists B (g_false_only(B,A) & ((all C (g_false_only(C,B) | g_false_only(B,C))) | -(exists C (g_true_only(B,C) & g_true_only(C,B))) & (exists C ((g_both(B,C) | g_both(C,B)) & -g_false_only(C,B) & -g_false_only(B,C)))) | ((all C (g_false_only(C,B) | g_false_only(B,C))) | (exists C (g_true_only(B,C) & g_true_only(C,B)))) & g_both(B,A) | (-(exists C (g_true_only(C,B) & g_true_only(B,C))) & (exists C ((g_both(C,B) | g_both(B,C)) & -g_false_only(C,B) & -g_falCputime limit exceeded (core dumped) 180.09/180.43 EOF