TSTP Solution File: SYN319+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN319+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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 11:18:04 EDT 2022
% Result : Theorem 0.39s 0.95s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SYN319+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.11 % 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 : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jul 11 21:48:24 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.39/0.95 ============================== Prover9 ===============================
% 0.39/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.39/0.95 Process 30615 was started by sandbox on n023.cluster.edu,
% 0.39/0.95 Mon Jul 11 21:48:25 2022
% 0.39/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30462_n023.cluster.edu".
% 0.39/0.95 ============================== end of head ===========================
% 0.39/0.95
% 0.39/0.95 ============================== INPUT =================================
% 0.39/0.95
% 0.39/0.95 % Reading from file /tmp/Prover9_30462_n023.cluster.edu
% 0.39/0.95
% 0.39/0.95 set(prolog_style_variables).
% 0.39/0.95 set(auto2).
% 0.39/0.95 % set(auto2) -> set(auto).
% 0.39/0.95 % set(auto) -> set(auto_inference).
% 0.39/0.95 % set(auto) -> set(auto_setup).
% 0.39/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.39/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.39/0.95 % set(auto) -> set(auto_limits).
% 0.39/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.39/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.39/0.95 % set(auto) -> set(auto_denials).
% 0.39/0.95 % set(auto) -> set(auto_process).
% 0.39/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.39/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.39/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.39/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.39/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.39/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.39/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.39/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.39/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.39/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.39/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.39/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.39/0.95 % set(auto2) -> assign(stats, some).
% 0.39/0.95 % set(auto2) -> clear(echo_input).
% 0.39/0.95 % set(auto2) -> set(quiet).
% 0.39/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.39/0.95 % set(auto2) -> clear(print_given).
% 0.39/0.95 assign(lrs_ticks,-1).
% 0.39/0.95 assign(sos_limit,10000).
% 0.39/0.95 assign(order,kbo).
% 0.39/0.95 set(lex_order_vars).
% 0.39/0.95 clear(print_given).
% 0.39/0.95
% 0.39/0.95 % formulas(sos). % not echoed (1 formulas)
% 0.39/0.95
% 0.39/0.95 ============================== end of input ==========================
% 0.39/0.95
% 0.39/0.95 % From the command line: assign(max_seconds, 300).
% 0.39/0.95
% 0.39/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.39/0.95
% 0.39/0.95 % Formulas that are not ordinary clauses:
% 0.39/0.95 1 -(exists X exists Y all Z1 all Z2 (((big_f(Y) -> big_g(Z1)) -> big_g(X) & -big_f(Z1)) -> ((big_f(X) | big_g(X) -> big_h(X)) -> big_h(Z2) & (big_h(Y) -> (big_f(Z2) | big_g(Z2) -> big_h(Z2)))))) # label(church_46_2_5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.39/0.95
% 0.39/0.95 ============================== end of process non-clausal formulas ===
% 0.39/0.95
% 0.39/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.39/0.95
% 0.39/0.95 ============================== PREDICATE ELIMINATION =================
% 0.39/0.95 2 -big_f(A) | big_h(A) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 3 -big_h(f2(A,B)) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 Derived: -big_f(f2(A,B)). [resolve(2,b,3,a)].
% 0.39/0.95 4 -big_g(A) | big_h(A) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 Derived: -big_g(f2(A,B)). [resolve(4,b,3,a)].
% 0.39/0.95
% 0.39/0.95 ============================== end predicate elimination =============
% 0.39/0.95
% 0.39/0.95 Auto_denials: (non-Horn, no changes).
% 0.39/0.95
% 0.39/0.95 Term ordering decisions:
% 0.39/0.95 Function symbol KB weights: f1=1. f2=1.
% 0.39/0.95
% 0.39/0.95 ============================== end of process initial clauses ========
% 0.39/0.95
% 0.39/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.39/0.95
% 0.39/0.95 ============================== end of clauses for search =============
% 0.39/0.95
% 0.39/0.95 ============================== SEARCH ================================
% 0.39/0.95
% 0.39/0.95 % Starting search at 0.01 seconds.
% 0.39/0.95
% 0.39/0.95 ============================== PROOF =================================
% 0.39/0.95 % SZS status Theorem
% 0.39/0.95 % SZS output start Refutation
% 0.39/0.95
% 0.39/0.95 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.39/0.95 % Length of proof is 9.
% 0.39/0.95 % Level of proof is 4.
% 0.39/0.95 % Maximum clause weight is 4.000.
% 0.39/0.95 % Given clauses 5.
% 0.39/0.95
% 0.39/0.95 1 -(exists X exists Y all Z1 all Z2 (((big_f(Y) -> big_g(Z1)) -> big_g(X) & -big_f(Z1)) -> ((big_f(X) | big_g(X) -> big_h(X)) -> big_h(Z2) & (big_h(Y) -> (big_f(Z2) | big_g(Z2) -> big_h(Z2)))))) # label(church_46_2_5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.39/0.95 2 -big_f(A) | big_h(A) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 3 -big_h(f2(A,B)) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 4 -big_g(A) | big_h(A) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 5 big_f(A) | big_g(B) # label(church_46_2_5) # label(negated_conjecture). [clausify(1)].
% 0.39/0.95 9 -big_f(f2(A,B)). [resolve(2,b,3,a)].
% 0.39/0.95 10 -big_g(f2(A,B)). [resolve(4,b,3,a)].
% 0.39/0.95 12 big_f(A). [resolve(10,a,5,b)].
% 0.39/0.95 13 $F. [resolve(12,a,9,a)].
% 0.39/0.95
% 0.39/0.95 % SZS output end Refutation
% 0.39/0.95 ============================== end of proof ==========================
% 0.39/0.95
% 0.39/0.95 ============================== STATISTICS ============================
% 0.39/0.95
% 0.39/0.95 Given=5. Generated=9. Kept=8. proofs=1.
% 0.39/0.95 Usable=5. Sos=1. Demods=0. Limbo=0, Disabled=10. Hints=0.
% 0.39/0.95 Megabytes=0.03.
% 0.39/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.39/0.95
% 0.39/0.95 ============================== end of statistics =====================
% 0.39/0.95
% 0.39/0.95 ============================== end of search =========================
% 0.39/0.95
% 0.39/0.95 THEOREM PROVED
% 0.39/0.95 % SZS status Theorem
% 0.39/0.95
% 0.39/0.95 Exiting with 1 proof.
% 0.39/0.95
% 0.39/0.95 Process 30615 exit (max_proofs) Mon Jul 11 21:48:25 2022
% 0.39/0.95 Prover9 interrupted
%------------------------------------------------------------------------------