TSTP Solution File: SYN070+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:05 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.12 % Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n016.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 21:04:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 13418 was started by sandbox on n016.cluster.edu,
% 0.43/0.98 Mon Jul 11 21:04:59 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13265_n016.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_13265_n016.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 (4 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 all Y (big_f(X) & (big_f(Y) & big_h(Y,X) -> big_g(Y)) -> big_g(X))) # label(pel46_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 2 (exists X (big_f(X) & -big_g(X))) -> (exists X1 (big_f(X1) & -big_g(X1) & (all Y (big_f(Y) & -big_g(Y) -> big_j(X1,Y))))) # label(pel46_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all X all Y (big_f(X) & big_f(Y) & big_h(X,Y) -> -big_j(Y,X))) # label(pel46_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 -(all X (big_f(X) -> big_g(X))) # label(pel46) # 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 5 -big_f(A) | big_h(B,A) | big_g(A) # label(pel46_1) # label(axiom). [clausify(1)].
% 0.43/0.98 6 -big_f(A) | -big_f(B) | -big_h(A,B) | -big_j(B,A) # label(pel46_3) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -big_f(A) | big_g(A) | -big_f(B) | -big_f(A) | -big_j(A,B). [resolve(5,b,6,c)].
% 0.43/0.98 7 -big_f(A) | big_g(A) | -big_f(B) | -big_f(A) | -big_j(A,B). [resolve(5,b,6,c)].
% 0.43/0.98 8 -big_f(A) | big_g(A) | -big_f(B) | big_g(B) | big_j(c1,B) # label(pel46_2) # label(axiom). [clausify(2)].
% 0.43/0.98 Derived: -big_f(c1) | big_g(c1) | -big_f(A) | -big_f(c1) | -big_f(B) | big_g(B) | -big_f(A) | big_g(A). [resolve(7,e,8,e)].
% 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 Function symbol KB weights: c1=1. c2=1.
% 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 21.
% 0.43/0.98 % Level of proof is 9.
% 0.43/0.98 % Maximum clause weight is 12.000.
% 0.43/0.98 % Given clauses 6.
% 0.43/0.98
% 0.43/0.98 1 (all X all Y (big_f(X) & (big_f(Y) & big_h(Y,X) -> big_g(Y)) -> big_g(X))) # label(pel46_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 2 (exists X (big_f(X) & -big_g(X))) -> (exists X1 (big_f(X1) & -big_g(X1) & (all Y (big_f(Y) & -big_g(Y) -> big_j(X1,Y))))) # label(pel46_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all X all Y (big_f(X) & big_f(Y) & big_h(X,Y) -> -big_j(Y,X))) # label(pel46_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 -(all X (big_f(X) -> big_g(X))) # label(pel46) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.98 5 -big_f(A) | big_h(B,A) | big_g(A) # label(pel46_1) # label(axiom). [clausify(1)].
% 0.43/0.98 6 -big_f(A) | -big_f(B) | -big_h(A,B) | -big_j(B,A) # label(pel46_3) # label(axiom). [clausify(3)].
% 0.43/0.98 7 -big_f(A) | big_g(A) | -big_f(B) | -big_f(A) | -big_j(A,B). [resolve(5,b,6,c)].
% 0.43/0.98 8 -big_f(A) | big_g(A) | -big_f(B) | big_g(B) | big_j(c1,B) # label(pel46_2) # label(axiom). [clausify(2)].
% 0.43/0.98 9 big_f(c2) # label(pel46) # label(negated_conjecture). [clausify(4)].
% 0.43/0.98 10 -big_g(c2) # label(pel46) # label(negated_conjecture). [clausify(4)].
% 0.43/0.98 11 -big_f(A) | big_f(B) | big_g(A) # label(pel46_1) # label(axiom). [clausify(1)].
% 0.43/0.98 12 -big_f(A) | -big_g(B) | big_g(A) # label(pel46_1) # label(axiom). [clausify(1)].
% 0.43/0.98 13 -big_f(c1) | big_g(c1) | -big_f(A) | -big_f(c1) | -big_f(B) | big_g(B) | -big_f(A) | big_g(A). [resolve(7,e,8,e)].
% 0.43/0.98 14 -big_f(c1) | big_g(c1) | -big_f(A) | -big_f(B) | big_g(B) | big_g(A). [copy(13),merge(d),merge(g)].
% 0.43/0.98 15 -big_f(c1) | big_g(c1) | -big_f(A) | big_g(A). [factor(14,a,c),merge(e)].
% 0.43/0.98 16 -big_f(c1) | big_g(c1). [factor(15,a,c),merge(c)].
% 0.43/0.98 17 big_f(A). [resolve(11,a,9,a),unit_del(b,10)].
% 0.43/0.98 18 big_g(c1). [back_unit_del(16),unit_del(a,17)].
% 0.43/0.98 19 -big_g(A) | big_g(B). [back_unit_del(12),unit_del(a,17)].
% 0.43/0.98 20 big_g(A). [resolve(19,a,18,a)].
% 0.43/0.98 21 $F. [resolve(20,a,10,a)].
% 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=6. Generated=19. Kept=11. proofs=1.
% 0.43/0.98 Usable=4. Sos=0. Demods=0. Limbo=0, Disabled=17. Hints=0.
% 0.43/0.98 Megabytes=0.03.
% 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 13418 exit (max_proofs) Mon Jul 11 21:04:59 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------