TSTP Solution File: SYN057+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:15:53 EDT 2022
% Result : Theorem 0.41s 0.99s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 : Tue Jul 12 01:44:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.99 ============================== Prover9 ===============================
% 0.41/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.99 Process 2160 was started by sandbox2 on n025.cluster.edu,
% 0.41/0.99 Tue Jul 12 01:44:48 2022
% 0.41/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2001_n025.cluster.edu".
% 0.41/0.99 ============================== end of head ===========================
% 0.41/0.99
% 0.41/0.99 ============================== INPUT =================================
% 0.41/0.99
% 0.41/0.99 % Reading from file /tmp/Prover9_2001_n025.cluster.edu
% 0.41/0.99
% 0.41/0.99 set(prolog_style_variables).
% 0.41/0.99 set(auto2).
% 0.41/0.99 % set(auto2) -> set(auto).
% 0.41/0.99 % set(auto) -> set(auto_inference).
% 0.41/0.99 % set(auto) -> set(auto_setup).
% 0.41/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.99 % set(auto) -> set(auto_limits).
% 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.99 % set(auto) -> set(auto_denials).
% 0.41/0.99 % set(auto) -> set(auto_process).
% 0.41/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.99 % set(auto2) -> assign(stats, some).
% 0.41/0.99 % set(auto2) -> clear(echo_input).
% 0.41/0.99 % set(auto2) -> set(quiet).
% 0.41/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.99 % set(auto2) -> clear(print_given).
% 0.41/0.99 assign(lrs_ticks,-1).
% 0.41/0.99 assign(sos_limit,10000).
% 0.41/0.99 assign(order,kbo).
% 0.41/0.99 set(lex_order_vars).
% 0.41/0.99 clear(print_given).
% 0.41/0.99
% 0.41/0.99 % formulas(sos). % not echoed (5 formulas)
% 0.41/0.99
% 0.41/0.99 ============================== end of input ==========================
% 0.41/0.99
% 0.41/0.99 % From the command line: assign(max_seconds, 300).
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.99
% 0.41/0.99 % Formulas that are not ordinary clauses:
% 0.41/0.99 1 (exists X (big_f(X) & -big_g(X))) # label(pel27_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 2 (all X (big_f(X) -> big_h(X))) # label(pel27_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 3 (all X (big_j(X) & big_i(X) -> big_f(X))) # label(pel27_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 4 (exists X (big_h(X) & -big_g(X))) -> (all X1 (big_i(X1) -> -big_h(X1))) # label(pel27_4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 5 -(all X (big_j(X) -> -big_i(X))) # label(pel27) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.99
% 0.41/0.99 ============================== end of process non-clausal formulas ===
% 0.41/0.99
% 0.41/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.99
% 0.41/0.99 ============================== PREDICATE ELIMINATION =================
% 0.41/0.99 6 -big_f(A) | big_h(A) # label(pel27_2) # label(axiom). [clausify(2)].
% 0.41/0.99 7 big_f(c1) # label(pel27_1) # label(axiom). [clausify(1)].
% 0.41/0.99 Derived: big_h(c1). [resolve(6,a,7,a)].
% 0.41/0.99 8 -big_j(A) | -big_i(A) | big_f(A) # label(pel27_3) # label(axiom). [clausify(3)].
% 0.41/0.99 Derived: -big_j(A) | -big_i(A) | big_h(A). [resolve(8,c,6,a)].
% 0.41/0.99 9 -big_j(A) | -big_i(A) | big_h(A). [resolve(8,c,6,a)].
% 0.41/0.99 10 big_j(c2) # label(pel27) # label(negated_conjecture). [clausify(5)].
% 0.41/0.99 Derived: -big_i(c2) | big_h(c2). [resolve(9,a,10,a)].
% 0.41/0.99 11 -big_h(A) | big_g(A) | -big_i(B) | -big_h(B) # label(pel27_4) # label(axiom). [clausify(4)].
% 0.41/0.99 12 big_i(c2) # label(pel27) # label(negated_conjecture). [clausify(5)].
% 0.41/0.99 Derived: -big_h(A) | big_g(A) | -big_h(c2). [resolve(11,c,12,a)].
% 0.41/0.99 13 -big_i(c2) | big_h(c2). [resolve(9,a,10,a)].
% 0.41/0.99 Derived: big_h(c2). [resolve(13,a,12,a)].
% 0.41/0.99 14 -big_h(A) | big_g(A) | -big_h(c2). [resolve(11,c,12,a)].
% 0.41/0.99 15 -big_g(c1) # label(pel27_1) # label(axiom). [clausify(1)].
% 0.41/0.99 Derived: -big_h(c1) | -big_h(c2). [resolve(14,b,15,a)].
% 0.41/0.99
% 0.41/0.99 ============================== end predicate elimination =============
% 0.41/0.99
% 0.41/0.99 Auto_denials: (no changes).
% 0.41/0.99
% 0.41/0.99 Term ordering decisions:
% 0.41/0.99 Function symbol KB weights: c1=1. c2=1.
% 0.41/0.99
% 0.41/0.99 ============================== PROOF =================================
% 0.41/0.99 % SZS status Theorem
% 0.41/0.99 % SZS output start Refutation
% 0.41/0.99
% 0.41/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.41/0.99 % Length of proof is 19.
% 0.41/0.99 % Level of proof is 5.
% 0.41/0.99 % Maximum clause weight is 2.000.
% 0.41/0.99 % Given clauses 0.
% 0.41/0.99
% 0.41/0.99 1 (exists X (big_f(X) & -big_g(X))) # label(pel27_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 2 (all X (big_f(X) -> big_h(X))) # label(pel27_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 3 (all X (big_j(X) & big_i(X) -> big_f(X))) # label(pel27_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 4 (exists X (big_h(X) & -big_g(X))) -> (all X1 (big_i(X1) -> -big_h(X1))) # label(pel27_4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.99 5 -(all X (big_j(X) -> -big_i(X))) # label(pel27) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.99 6 -big_f(A) | big_h(A) # label(pel27_2) # label(axiom). [clausify(2)].
% 0.41/0.99 7 big_f(c1) # label(pel27_1) # label(axiom). [clausify(1)].
% 0.41/0.99 8 -big_j(A) | -big_i(A) | big_f(A) # label(pel27_3) # label(axiom). [clausify(3)].
% 0.41/0.99 9 -big_j(A) | -big_i(A) | big_h(A). [resolve(8,c,6,a)].
% 0.41/0.99 10 big_j(c2) # label(pel27) # label(negated_conjecture). [clausify(5)].
% 0.41/0.99 11 -big_h(A) | big_g(A) | -big_i(B) | -big_h(B) # label(pel27_4) # label(axiom). [clausify(4)].
% 0.41/0.99 12 big_i(c2) # label(pel27) # label(negated_conjecture). [clausify(5)].
% 0.41/0.99 13 -big_i(c2) | big_h(c2). [resolve(9,a,10,a)].
% 0.41/0.99 14 -big_h(A) | big_g(A) | -big_h(c2). [resolve(11,c,12,a)].
% 0.41/0.99 15 -big_g(c1) # label(pel27_1) # label(axiom). [clausify(1)].
% 0.41/0.99 16 big_h(c1). [resolve(6,a,7,a)].
% 0.41/0.99 17 big_h(c2). [resolve(13,a,12,a)].
% 0.41/0.99 18 -big_h(c1) | -big_h(c2). [resolve(14,b,15,a)].
% 0.41/0.99 19 $F. [copy(18),unit_del(a,16),unit_del(b,17)].
% 0.41/0.99
% 0.41/0.99 % SZS output end Refutation
% 0.41/0.99 ============================== end of proof ==========================
% 0.41/0.99
% 0.41/0.99 ============================== STATISTICS ============================
% 0.41/0.99
% 0.41/0.99 Given=0. Generated=3. Kept=2. proofs=1.
% 0.41/0.99 Usable=0. Sos=0. Demods=0. Limbo=2, Disabled=13. Hints=0.
% 0.41/0.99 Megabytes=0.02.
% 0.41/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.99
% 0.41/0.99 ============================== end of statistics =====================
% 0.41/0.99
% 0.41/0.99 ============================== end of search =========================
% 0.41/0.99
% 0.41/0.99 THEOREM PROVED
% 0.41/0.99 % SZS status Theorem
% 0.41/0.99
% 0.41/0.99 Exiting with 1 proof.
% 0.41/0.99
% 0.41/0.99 Process 2160 exit (max_proofs) Tue Jul 12 01:44:48 2022
% 0.41/0.99 Prover9 interrupted
%------------------------------------------------------------------------------