TSTP Solution File: SYN328+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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:11 EDT 2022
% Result : Theorem 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 06:22:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 26214 was started by sandbox on n009.cluster.edu,
% 0.44/0.99 Tue Jul 12 06:22:37 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_26060_n009.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_26060_n009.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 -(exists X all Y all Z (((big_f(Y) -> big_g(Y)) <-> big_f(X)) -> (((big_f(Y) -> big_h(Y)) <-> big_g(X)) -> ((((big_f(Y) -> big_g(Y)) -> big_h(Y)) <-> big_h(X)) -> big_f(Z) & big_g(Z) & big_h(Z))))) # label(church_46_12_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 2 -big_f(f2(A)) | -big_g(f2(A)) | -big_h(f2(A)) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 3 big_f(f1(A)) | big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: -big_f(f2(A)) | -big_h(f2(A)) | big_f(f1(f2(A))). [resolve(2,b,3,b)].
% 0.44/0.99 4 -big_g(f1(A)) | big_f(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: big_f(A) | big_f(f1(f1(A))). [resolve(4,a,3,b)].
% 0.44/0.99 5 -big_h(f1(A)) | big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: -big_h(f1(f2(A))) | -big_f(f2(A)) | -big_h(f2(A)). [resolve(5,b,2,b)].
% 0.44/0.99 Derived: -big_h(f1(f1(A))) | big_f(A). [resolve(5,b,4,a)].
% 0.44/0.99 6 -big_f(f1(A)) | big_g(f1(A)) | -big_f(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 7 -big_f(f1(A)) | big_h(f1(A)) | -big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: -big_f(f1(f1(A))) | big_h(f1(f1(A))) | -big_f(f1(A)) | -big_f(A). [resolve(7,c,6,b)].
% 0.44/0.99 8 -big_f(f1(A)) | big_g(f1(A)) | big_h(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: -big_f(f1(A)) | big_h(A) | big_f(A). [resolve(8,b,4,a)].
% 0.44/0.99 Derived: -big_f(f1(A)) | big_h(A) | -big_f(f1(f1(A))) | big_h(f1(f1(A))). [resolve(8,b,7,c)].
% 0.44/0.99 9 -big_g(f1(A)) | big_h(f1(A)) | -big_h(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 Derived: big_h(f1(A)) | -big_h(A) | big_f(f1(f1(A))). [resolve(9,a,3,b)].
% 0.44/0.99 Derived: big_h(f1(A)) | -big_h(A) | -big_h(f1(f1(A))). [resolve(9,a,5,b)].
% 0.44/0.99 Derived: big_h(f1(A)) | -big_h(A) | -big_f(f1(A)) | -big_f(A). [resolve(9,a,6,b)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: f1=1. f2=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 29.
% 0.44/0.99 % Level of proof is 14.
% 0.44/0.99 % Maximum clause weight is 14.000.
% 0.44/0.99 % Given clauses 40.
% 0.44/0.99
% 0.44/0.99 1 -(exists X all Y all Z (((big_f(Y) -> big_g(Y)) <-> big_f(X)) -> (((big_f(Y) -> big_h(Y)) <-> big_g(X)) -> ((((big_f(Y) -> big_g(Y)) -> big_h(Y)) <-> big_h(X)) -> big_f(Z) & big_g(Z) & big_h(Z))))) # label(church_46_12_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/0.99 2 -big_f(f2(A)) | -big_g(f2(A)) | -big_h(f2(A)) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 3 big_f(f1(A)) | big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 4 -big_g(f1(A)) | big_f(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 5 -big_h(f1(A)) | big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 6 -big_f(f1(A)) | big_g(f1(A)) | -big_f(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 7 -big_f(f1(A)) | big_h(f1(A)) | -big_g(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 8 -big_f(f1(A)) | big_g(f1(A)) | big_h(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 10 big_f(f1(A)) | big_f(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 11 -big_h(f1(A)) | big_h(A) # label(church_46_12_3) # label(negated_conjecture). [clausify(1)].
% 0.44/0.99 14 big_f(A) | big_f(f1(f1(A))). [resolve(4,a,3,b)].
% 0.44/0.99 15 -big_h(f1(f2(A))) | -big_f(f2(A)) | -big_h(f2(A)). [resolve(5,b,2,b)].
% 0.44/0.99 16 -big_h(f1(f1(A))) | big_f(A). [resolve(5,b,4,a)].
% 0.44/0.99 17 -big_f(f1(f1(A))) | big_h(f1(f1(A))) | -big_f(f1(A)) | -big_f(A). [resolve(7,c,6,b)].
% 0.44/0.99 18 -big_f(f1(A)) | big_h(A) | big_f(A). [resolve(8,b,4,a)].
% 0.44/0.99 22 big_h(A) | big_f(A). [resolve(18,a,10,a),merge(c)].
% 0.44/0.99 23 big_f(f1(A)) | big_h(A). [resolve(22,a,11,a)].
% 0.44/0.99 24 big_f(f1(f1(f1(A)))) | big_f(A). [resolve(23,b,16,a)].
% 0.44/0.99 32 big_f(A) | big_h(f1(f1(f1(A)))) | -big_f(f1(f1(A))) | -big_f(f1(A)). [resolve(24,a,17,a)].
% 0.44/0.99 58 big_f(A) | big_h(f1(f1(f1(A)))) | -big_f(f1(A)). [resolve(32,c,14,b),merge(d)].
% 0.44/0.99 59 big_f(A) | big_h(f1(f1(f1(A)))). [resolve(58,c,10,a),merge(c)].
% 0.44/0.99 61 big_f(A) | big_h(f1(f1(A))). [resolve(59,b,11,a)].
% 0.44/0.99 62 big_f(A). [resolve(61,b,16,a),merge(b)].
% 0.44/0.99 65 big_h(f1(f1(A))). [back_unit_del(17),unit_del(a,62),unit_del(c,62),unit_del(d,62)].
% 0.44/0.99 66 -big_h(f1(f2(A))) | -big_h(f2(A)). [back_unit_del(15),unit_del(b,62)].
% 0.44/0.99 67 big_h(f1(A)). [resolve(65,a,11,a)].
% 0.44/0.99 68 -big_h(f2(A)). [back_unit_del(66),unit_del(a,67)].
% 0.44/0.99 69 big_h(A). [back_unit_del(11),unit_del(a,67)].
% 0.44/0.99 70 $F. [resolve(69,a,68,a)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=40. Generated=108. Kept=60. proofs=1.
% 0.44/0.99 Usable=1. Sos=0. Demods=0. Limbo=2, Disabled=77. Hints=0.
% 0.44/0.99 Megabytes=0.07.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Theorem
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 26214 exit (max_proofs) Tue Jul 12 06:22:37 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------