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