TSTP Solution File: SYN084+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:16:16 EDT 2022
% Result : Theorem 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 12:48:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 1992 was started by sandbox2 on n013.cluster.edu,
% 0.43/0.98 Mon Jul 11 12:48:45 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1831_n013.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_1831_n013.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (1 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98 1 -((all X (big_p(a) & (big_p(X) -> big_p(f(X))) -> big_p(f(f(X))))) <-> (all X1 ((-big_p(a) | big_p(X1) | big_p(f(f(X1)))) & (-big_p(a) | -big_p(f(X1)) | big_p(f(f(X1))))))) # label(pel62) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98
% 0.43/0.98 % Assigning unary symbol f kb_weight 0 and highest precedence (5).
% 0.43/0.98 Function symbol KB weights: a=1. c1=1. c2=1. f=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.98 % Length of proof is 33.
% 0.43/0.98 % Level of proof is 18.
% 0.43/0.98 % Maximum clause weight is 14.000.
% 0.43/0.98 % Given clauses 26.
% 0.43/0.98
% 0.43/0.98 1 -((all X (big_p(a) & (big_p(X) -> big_p(f(X))) -> big_p(f(f(X))))) <-> (all X1 ((-big_p(a) | big_p(X1) | big_p(f(f(X1)))) & (-big_p(a) | -big_p(f(X1)) | big_p(f(f(X1))))))) # label(pel62) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98 2 big_p(a) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 3 -big_p(f(f(c1))) | -big_p(f(f(c2))) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 4 -big_p(c1) | big_p(f(c1)) | -big_p(f(f(c2))) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 5 -big_p(f(f(c1))) | -big_p(c2) | big_p(f(c2)) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 6 -big_p(c1) | big_p(f(c1)) | -big_p(c2) | big_p(f(c2)) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 7 -big_p(a) | big_p(A) | big_p(f(f(A))) | big_p(B) | big_p(f(f(B))) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 8 big_p(A) | big_p(f(f(A))) | big_p(B) | big_p(f(f(B))). [copy(7),unit_del(a,2)].
% 0.43/0.98 12 -big_p(a) | -big_p(f(A)) | big_p(f(f(A))) | -big_p(f(B)) | big_p(f(f(B))) # label(pel62) # label(negated_conjecture). [clausify(1)].
% 0.43/0.98 13 -big_p(f(A)) | big_p(f(f(A))) | -big_p(f(B)) | big_p(f(f(B))). [copy(12),unit_del(a,2)].
% 0.43/0.98 14 big_p(A) | big_p(f(f(A))). [factor(8,a,c),merge(c)].
% 0.43/0.98 15 -big_p(f(A)) | big_p(f(f(A))). [factor(13,a,c),merge(c)].
% 0.43/0.98 16 big_p(c1) | -big_p(c2) | big_p(f(c2)). [resolve(14,b,5,a)].
% 0.43/0.98 17 big_p(c2) | -big_p(c1) | big_p(f(c1)). [resolve(14,b,4,c)].
% 0.43/0.98 18 big_p(c2) | -big_p(f(f(c1))). [resolve(14,b,3,b)].
% 0.43/0.98 20 big_p(c2) | big_p(c1). [resolve(18,b,14,b)].
% 0.43/0.98 21 big_p(c1) | big_p(f(c2)). [resolve(20,a,16,b),merge(b)].
% 0.43/0.98 22 big_p(c1) | big_p(f(f(c2))). [resolve(21,b,15,a)].
% 0.43/0.98 24 big_p(c1) | -big_p(f(f(c1))). [resolve(22,b,3,b)].
% 0.43/0.98 25 big_p(c1). [resolve(24,b,14,b),merge(b)].
% 0.43/0.98 26 big_p(c2) | big_p(f(c1)). [back_unit_del(17),unit_del(b,25)].
% 0.43/0.98 27 big_p(f(c1)) | -big_p(c2) | big_p(f(c2)). [back_unit_del(6),unit_del(a,25)].
% 0.43/0.98 28 big_p(f(c1)) | -big_p(f(f(c2))). [back_unit_del(4),unit_del(a,25)].
% 0.43/0.98 29 big_p(c2) | big_p(f(f(c1))). [resolve(26,b,15,a)].
% 0.43/0.98 30 big_p(c2). [resolve(29,b,18,b),merge(b)].
% 0.43/0.98 31 big_p(f(c1)) | big_p(f(c2)). [back_unit_del(27),unit_del(b,30)].
% 0.43/0.98 32 -big_p(f(f(c1))) | big_p(f(c2)). [back_unit_del(5),unit_del(b,30)].
% 0.43/0.98 34 big_p(f(c1)) | big_p(f(f(c2))). [resolve(31,b,15,a)].
% 0.43/0.98 36 big_p(f(c1)). [resolve(34,b,28,b),merge(b)].
% 0.43/0.98 37 big_p(f(f(c1))). [resolve(36,a,15,a)].
% 0.43/0.98 38 big_p(f(c2)). [back_unit_del(32),unit_del(a,37)].
% 0.43/0.98 39 -big_p(f(f(c2))). [back_unit_del(3),unit_del(a,37)].
% 0.43/0.98 40 $F. [resolve(38,a,15,a),unit_del(a,39)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=26. Generated=50. Kept=34. proofs=1.
% 0.43/0.98 Usable=9. Sos=3. Demods=0. Limbo=0, Disabled=31. Hints=0.
% 0.43/0.98 Megabytes=0.04.
% 0.43/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Theorem
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 1992 exit (max_proofs) Mon Jul 11 12:48:45 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------