TSTP Solution File: SYO609+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO609+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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 : Timeout 300.07s 300.45s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO609+1 : TPTP v8.1.0. Released v7.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n014.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 : Sat Jul 9 03:27:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.04 ============================== Prover9 ===============================
% 0.75/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.04 Process 9320 was started by sandbox2 on n014.cluster.edu,
% 0.75/1.04 Sat Jul 9 03:27:21 2022
% 0.75/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9167_n014.cluster.edu".
% 0.75/1.04 ============================== end of head ===========================
% 0.75/1.04
% 0.75/1.04 ============================== INPUT =================================
% 0.75/1.04
% 0.75/1.04 % Reading from file /tmp/Prover9_9167_n014.cluster.edu
% 0.75/1.04
% 0.75/1.04 set(prolog_style_variables).
% 0.75/1.04 set(auto2).
% 0.75/1.04 % set(auto2) -> set(auto).
% 0.75/1.04 % set(auto) -> set(auto_inference).
% 0.75/1.04 % set(auto) -> set(auto_setup).
% 0.75/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.04 % set(auto) -> set(auto_limits).
% 0.75/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.04 % set(auto) -> set(auto_denials).
% 0.75/1.04 % set(auto) -> set(auto_process).
% 0.75/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.04 % set(auto2) -> assign(stats, some).
% 0.75/1.04 % set(auto2) -> clear(echo_input).
% 0.75/1.04 % set(auto2) -> set(quiet).
% 0.75/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.04 % set(auto2) -> clear(print_given).
% 0.75/1.04 assign(lrs_ticks,-1).
% 0.75/1.04 assign(sos_limit,10000).
% 0.75/1.04 assign(order,kbo).
% 0.75/1.04 set(lex_order_vars).
% 0.75/1.04 clear(print_given).
% 0.75/1.04
% 0.75/1.04 % formulas(sos). % not echoed (12 formulas)
% 0.75/1.04
% 0.75/1.04 ============================== end of input ==========================
% 0.75/1.04
% 0.75/1.04 % From the command line: assign(max_seconds, 300).
% 0.75/1.04
% 0.75/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.04
% 0.75/1.04 % Formulas that are not ordinary clauses:
% 0.75/1.04 1 (all A exists B g_true_only(A,B)) | (exists A ((exists B g_both(A,B)) & -(exists B g_true_only(A,B)))) & -(exists A all B g_false_only(A,B)) # label(na8_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 2 (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(na8_2) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 3 (all A g_false_only(A,A)) | (exists A g_both(A,A)) & -(exists A g_true_only(A,A)) # label(na8_3) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 4 (all X_1 (h_true_only(X_1) <-> h_true(X_1) & -h_false(X_1))) # label(true_only_h) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 5 (all X_1 (h_both(X_1) <-> h_true(X_1) & h_false(X_1))) # label(both_h) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 6 (all X_1 (h_false_only(X_1) <-> h_false(X_1) & -h_true(X_1))) # label(false_only_h) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 7 (all X_1 (h_true_only(X_1) | h_both(X_1) | h_false_only(X_1))) # label(exhaustion_h) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.04 8 (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].
% 0.75/1.04 9 (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].
% 2.24/2.56 10 (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].
% 2.24/2.56 11 (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].
% 2.24/2.56 12 -((all A all B (h_false_only(A) | h_false_only(B) | g_true_only(A,B) | g_true_only(B,A))) | (exists A ((exists B ((h_both(A) | h_both(B)) & -h_false_only(A) & -h_false_only(B) & (g_both(A,B) | g_both(B,A)) & -g_true_only(A,B) & -g_true_only(B,A))) & -(exists B (h_true_only(A) & h_true_only(B) & ((g_both(A,B) | g_both(B,A)) & -g_true_only(A,B) & -g_true_only(B,A) | g_false_only(A,B) & g_false_only(B,A)) | (h_both(A) | h_both(B)) & -h_false_only(A) & -h_false_only(B) & g_false_only(A,B) & g_false_only(B,A))))) & -(exists A exists B (h_true_only(A) & h_true_only(B) & ((g_both(A,B) | g_both(B,A)) & -g_true_only(A,B) & -g_true_only(B,A) | g_false_only(A,B) & g_false_only(B,A)) | (h_both(A) | h_both(B)) & -h_false_only(A) & -h_false_only(B) & g_false_only(A,B) & g_false_only(B,A)))) # label(nc8) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.24/2.56
% 2.24/2.56 ============================== end of process non-clausal formulas ===
% 2.24/2.56
% 2.24/2.56 ============================== PROCESS INITIAL CLAUSES ===============
% 2.24/2.56
% 2.24/2.56 ============================== PREDICATE ELIMINATION =================
% 2.24/2.56 13 h_true_only(A) | -h_true(A) | h_false(A) # label(true_only_h) # label(axiom). [clausify(4)].
% 2.24/2.56 14 -h_true_only(A) | h_true(A) # label(true_only_h) # label(axiom). [clausify(4)].
% 2.24/2.56 15 -h_both(A) | h_true(A) # label(both_h) # label(axiom). [clausify(5)].
% 2.24/2.56 16 h_both(A) | -h_true(A) | -h_false(A) # label(both_h) # label(axiom). [clausify(5)].
% 2.24/2.56 Derived: h_both(A) | -h_false(A) | -h_true_only(A). [resolve(16,b,14,b)].
% 2.24/2.56 17 -h_false_only(A) | -h_true(A) # label(false_only_h) # label(axiom). [clausify(6)].
% 2.24/2.56 Derived: -h_false_only(A) | -h_true_only(A). [resolve(17,b,14,b)].
% 2.24/2.56 Derived: -h_false_only(A) | -h_both(A). [resolve(17,b,15,b)].
% 2.24/2.56 18 h_false_only(A) | -h_false(A) | h_true(A) # label(false_only_h) # label(axiom). [clausify(6)].
% 2.24/2.56 Derived: h_false_only(A) | -h_false(A) | h_both(A) | -h_false(A). [resolve(18,c,16,b)].
% 2.24/2.56 19 g_true_only(A,B) | -g_true(A,B) | g_false(A,B) # label(true_only_g) # label(axiom). [clausify(8)].
% 2.24/2.56 20 -g_true_only(A,B) | g_true(A,B) # label(true_only_g) # label(axiom). [clausify(8)].
% 2.24/2.56 21 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(9)].
% 2.24/2.56 22 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(9)].
% 2.24/2.56 Derived: g_both(A,B) | -g_false(A,B) | -g_true_only(A,B). [resolve(22,b,20,b)].
% 2.24/2.56 23 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(10)].
% 2.24/2.56 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(23,b,20,b)].
% 2.24/2.56 Derived: -g_false_only(A,B) | -g_both(A,B). [resolve(23,b,21,b)].
% 2.24/2.56 24 g_false_only(A,B) | -g_false(A,B) | g_true(A,B) # label(false_only_g) # label(axiom). [clausify(10)].
% 2.24/2.56 Derived: g_false_only(A,B) | -g_false(A,B) | g_both(A,B) | -g_false(A,B). [resolve(24,c,22,b)].
% 2.24/2.56
% 2.24/2.56 ============================== end predicate elimination =============
% 2.24/2.56
% 2.24/2.56 Auto_denials: (non-Horn, no changes).
% 2.24/2.56
% 2.24/2.56 Term ordering decisions:
% 2.24/2.56 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f1=1. f2=1. f3=1.
% 2.24/2.56
% 2.24/2.56 ============================== end of process initial clauses ========
% 2.24/2.56
% 2.24/2.56 ============================== CLAUSES FOR SEARCH ====================
% 2.24/2.56
% 2.24/2.56 ============================== end of clauses for search =============
% 2.24/2.56
% 2.24/2.56 ============================== SEARCH ================================
% 2.24/2.56
% 2.24/2.56 % Starting search at 0.61 seconds.
% 2.24/2.56
% 2.24/2.56 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 33 (0.00 of 0.64 sec).
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=38.000, iters=3372
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=37.000, iters=3632
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=36.000, iters=3724
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=35.000, iters=3334
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=34.000, iters=3547
% 2.24/2.56
% 2.24/2.56 Low Water (keep): wt=33.000, iters=3333
% 2.24/2.56
% 2.24/2.56 Low Water (displaCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------