TSTP Solution File: SYN920+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:23:36 EDT 2022
% Result : Theorem 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.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:47:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 24432 was started by sandbox on n028.cluster.edu,
% 0.45/0.99 Mon Jul 11 21:47:14 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_24278_n028.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_24278_n028.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (1 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99 1 -(((all X (f(X) & g(X) -> h(X))) -> (exists X (f(X) & -g(X)))) & ((all W (f(W) -> g(W))) | (all Z (f(Z) -> h(Z)))) -> ((all R (f(R) & h(R) -> g(R))) -> (exists V (f(V) & g(V) & -h(V))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99 2 -f(A) | -g(A) | h(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 3 -h(c1) | -g(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 4 -h(c1) | f(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 5 -f(A) | -h(A) | g(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 Derived: -f(c1) | -g(c1) | -g(c2). [resolve(2,c,3,a)].
% 0.45/0.99 Derived: -f(c1) | -g(c1) | f(c2). [resolve(2,c,4,a)].
% 0.45/0.99 6 -f(A) | g(A) | -f(B) | h(B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 Derived: -f(A) | g(A) | -f(c1) | -g(c2). [resolve(6,d,3,a)].
% 0.45/0.99 Derived: -f(A) | g(A) | -f(c1) | f(c2). [resolve(6,d,4,a)].
% 0.45/0.99 Derived: -f(A) | g(A) | -f(B) | -f(B) | g(B). [resolve(6,d,5,b)].
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials: (non-Horn, no changes).
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99 Function symbol KB weights: c1=1. c2=1.
% 0.45/0.99
% 0.45/0.99 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/0.99 % Length of proof is 22.
% 0.45/0.99 % Level of proof is 9.
% 0.45/0.99 % Maximum clause weight is 8.000.
% 0.45/0.99 % Given clauses 11.
% 0.45/0.99
% 0.45/0.99 1 -(((all X (f(X) & g(X) -> h(X))) -> (exists X (f(X) & -g(X)))) & ((all W (f(W) -> g(W))) | (all Z (f(Z) -> h(Z)))) -> ((all R (f(R) & h(R) -> g(R))) -> (exists V (f(V) & g(V) & -h(V))))) # label(prove_this) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.99 2 -f(A) | -g(A) | h(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 3 -h(c1) | -g(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 4 -h(c1) | f(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 5 -f(A) | -h(A) | g(A) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 6 -f(A) | g(A) | -f(B) | h(B) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 7 f(c1) | f(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 8 g(c1) | f(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 9 f(c1) | -g(c2) # label(prove_this) # label(negated_conjecture). [clausify(1)].
% 0.45/0.99 11 -f(c1) | -g(c1) | -g(c2). [resolve(2,c,3,a)].
% 0.45/0.99 12 -f(c1) | -g(c1) | f(c2). [resolve(2,c,4,a)].
% 0.45/0.99 15 -f(A) | g(A) | -f(B) | -f(B) | g(B). [resolve(6,d,5,b)].
% 0.45/0.99 16 -f(A) | g(A) | -f(B) | g(B). [copy(15),merge(d)].
% 0.45/0.99 17 -f(A) | g(A). [factor(16,a,c),merge(c)].
% 0.45/0.99 18 -f(c1) | f(c2). [resolve(12,b,8,a),merge(c)].
% 0.45/0.99 19 g(c2) | f(c1). [resolve(17,a,7,b)].
% 0.45/0.99 21 f(c1). [resolve(19,a,9,b),merge(b)].
% 0.45/0.99 22 f(c2). [back_unit_del(18),unit_del(a,21)].
% 0.45/0.99 23 -g(c1) | -g(c2). [back_unit_del(11),unit_del(a,21)].
% 0.45/0.99 24 g(c1). [resolve(21,a,17,a)].
% 0.45/0.99 25 -g(c2). [back_unit_del(23),unit_del(a,24)].
% 0.45/0.99 26 $F. [resolve(22,a,17,a),unit_del(a,25)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=11. Generated=23. Kept=18. proofs=1.
% 0.45/0.99 Usable=3. Sos=2. Demods=0. Limbo=0, Disabled=27. Hints=0.
% 0.45/0.99 Megabytes=0.04.
% 0.45/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Theorem
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 24432 exit (max_proofs) Mon Jul 11 21:47:14 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------