TSTP Solution File: SYO608+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO608+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 19:17:33 EDT 2022
% Result : Unknown 37.52s 37.83s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO608+1 : TPTP v8.1.0. Released v7.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n010.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 : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 8 23:28:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.10/1.44 ============================== Prover9 ===============================
% 1.10/1.44 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.44 Process 19516 was started by sandbox on n010.cluster.edu,
% 1.10/1.44 Fri Jul 8 23:28:46 2022
% 1.10/1.44 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19163_n010.cluster.edu".
% 1.10/1.44 ============================== end of head ===========================
% 1.10/1.44
% 1.10/1.44 ============================== INPUT =================================
% 1.10/1.44
% 1.10/1.44 % Reading from file /tmp/Prover9_19163_n010.cluster.edu
% 1.10/1.44
% 1.10/1.44 set(prolog_style_variables).
% 1.10/1.44 set(auto2).
% 1.10/1.44 % set(auto2) -> set(auto).
% 1.10/1.44 % set(auto) -> set(auto_inference).
% 1.10/1.44 % set(auto) -> set(auto_setup).
% 1.10/1.44 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.44 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.44 % set(auto) -> set(auto_limits).
% 1.10/1.44 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.44 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.44 % set(auto) -> set(auto_denials).
% 1.10/1.44 % set(auto) -> set(auto_process).
% 1.10/1.44 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.44 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.44 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.44 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.44 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.44 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.44 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.44 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.44 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.44 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.44 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.44 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.44 % set(auto2) -> assign(stats, some).
% 1.10/1.44 % set(auto2) -> clear(echo_input).
% 1.10/1.44 % set(auto2) -> set(quiet).
% 1.10/1.44 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.44 % set(auto2) -> clear(print_given).
% 1.10/1.44 assign(lrs_ticks,-1).
% 1.10/1.44 assign(sos_limit,10000).
% 1.10/1.44 assign(order,kbo).
% 1.10/1.44 set(lex_order_vars).
% 1.10/1.44 clear(print_given).
% 1.10/1.44
% 1.10/1.44 % formulas(sos). % not echoed (7 formulas)
% 1.10/1.44
% 1.10/1.44 ============================== end of input ==========================
% 1.10/1.44
% 1.10/1.44 % From the command line: assign(max_seconds, 300).
% 1.10/1.44
% 1.10/1.44 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.44
% 1.10/1.44 % Formulas that are not ordinary clauses:
% 1.10/1.44 1 (all A g_false_only(A,A)) | (exists A g_both(A,A)) & -(exists A g_true_only(A,A)) # label(na7_1) # label(axiom) # label(non_clause). [assumption].
% 1.10/1.44 2 (all A exists B (g_true_only(A,B) & (all C (g_false_only(B,C) | g_true_only(A,C))))) | (exists A ((exists B ((g_both(A,B) | (exists C (g_both(B,C) & g_both(A,C))) & -(exists C (g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | g_both(B,C) & g_false_only(A,C)))) & -g_false_only(A,B) & -(exists C (g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | g_both(B,C) & g_false_only(A,C))))) & -(exists B (g_true_only(A,B) & (all C (g_false_only(B,C) | g_true_only(A,C))))))) & -(exists A all B (g_false_only(A,B) | (exists C (g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | g_both(B,C) & g_false_only(A,C))))) # label(na7_2) # label(axiom) # label(non_clause). [assumption].
% 1.10/1.44 3 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> g_true(X_2,X_1) & -g_false(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption].
% 1.10/1.44 4 (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].
% 1.10/1.44 5 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> g_false(X_2,X_1) & -g_true(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption].
% 1.10/1.44 6 (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].
% 1.10/1.44 7 -((all A all B all C (g_false_only(A,B) | g_false_only(B,C) | g_true_only(A,C))) | (exists A ((exists B ((exists C ((g_both(A,B) | g_both(B,C)) & -g_false_only(A,B) & -g_false_only(B,C) & g_both(A,C))) & -(exists C (g_true_only(A,B) & g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | (g_both(A,B) | g_both(B,C)) & -g_false_only(A,B) & -g_false_only(B,C) & g_false_only(A,C))))) & -(exists B exists C (g_true_only(A,B) & g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | (g_both(A,B) | g_both(B,C)) & -g_false_only(A,B) & -g_false_only(B,C) & g_false_only(A,C))))) & -(exists A exists B exists C (g_true_only(A,B) & g_true_only(B,C) & (g_both(A,C) | g_false_only(A,C)) | (g_both(A,B) | g_both(B,C)) & -g_false_only(A,B) & -g_false_only(B,C) & g_false_only(A,C)))) # label(nc7) # label(negated_conjecture) # label(non_clause). [assumption].
% 37.52/37.82
% 37.52/37.82 ============================== end of process non-clausal formulas ===
% 37.52/37.82
% 37.52/37.82 ============================== PROCESS INITIAL CLAUSES ===============
% 37.52/37.82
% 37.52/37.82 ============================== PREDICATE ELIMINATION =================
% 37.52/37.82 8 g_true_only(A,B) | -g_true(A,B) | g_false(A,B) # label(true_only_g) # label(axiom). [clausify(3)].
% 37.52/37.82 9 -g_true_only(A,B) | g_true(A,B) # label(true_only_g) # label(axiom). [clausify(3)].
% 37.52/37.82 10 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(4)].
% 37.52/37.82 11 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(4)].
% 37.52/37.82 Derived: g_both(A,B) | -g_false(A,B) | -g_true_only(A,B). [resolve(11,b,9,b)].
% 37.52/37.82 12 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(5)].
% 37.52/37.82 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(12,b,9,b)].
% 37.52/37.82 Derived: -g_false_only(A,B) | -g_both(A,B). [resolve(12,b,10,b)].
% 37.52/37.82 13 g_false_only(A,B) | -g_false(A,B) | g_true(A,B) # label(false_only_g) # label(axiom). [clausify(5)].
% 37.52/37.82 Derived: g_false_only(A,B) | -g_false(A,B) | g_both(A,B) | -g_false(A,B). [resolve(13,c,11,b)].
% 37.52/37.82
% 37.52/37.82 ============================== end predicate elimination =============
% 37.52/37.82
% 37.52/37.82 Auto_denials: (non-Horn, no changes).
% 37.52/37.82
% 37.52/37.82 Term ordering decisions:
% 37.52/37.82 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f4=1. f1=1. f2=1. f3=1. f5=1. f6=1.
% 37.52/37.82
% 37.52/37.82 ============================== end of process initial clauses ========
% 37.52/37.82
% 37.52/37.82 ============================== CLAUSES FOR SEARCH ====================
% 37.52/37.82
% 37.52/37.82 ============================== end of clauses for search =============
% 37.52/37.82
% 37.52/37.82 ============================== SEARCH ================================
% 37.52/37.82
% 37.52/37.82 % Starting search at 0.77 seconds.
% 37.52/37.82
% 37.52/37.82 Low Water (keep): wt=14.000, iters=2147483647
% 37.52/37.82
% 37.52/37.82 Low Water (keep): wt=13.000, iters=2147483647
% 37.52/37.82
% 37.52/37.82 Low Water (keep): wt=6.000, iters=2147483647
% 37.52/37.82
% 37.52/37.82 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 92 (0.00 of 0.82 sec).
% 37.52/37.82
% 37.52/37.82 ============================== STATISTICS ============================
% 37.52/37.82
% 37.52/37.82 Given=14126. Generated=140611. Kept=14168. proofs=0.
% 37.52/37.82 Usable=14126. Sos=0. Demods=0. Limbo=0, Disabled=1063. Hints=0.
% 37.52/37.82 Megabytes=30.71.
% 37.52/37.82 User_CPU=36.70, System_CPU=0.11, Wall_clock=37.
% 37.52/37.82
% 37.52/37.82 ============================== end of statistics =====================
% 37.52/37.82
% 37.52/37.82 ============================== end of search =========================
% 37.52/37.82
% 37.52/37.82 SEARCH FAILED
% 37.52/37.82
% 37.52/37.82 Exiting with failure.
% 37.52/37.82
% 37.52/37.82 Process 19516 exit (sos_empty) Fri Jul 8 23:29:23 2022
% 37.52/37.82 Prover9 interrupted
%------------------------------------------------------------------------------