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