TSTP Solution File: SYN065+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:01 EDT 2022
% Result : Theorem 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 09:16:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07
% 0.44/1.07 WARNING: denials share constants (see output).
% 0.44/1.07
% 0.44/1.07 ============================== Prover9 ===============================
% 0.44/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.07 Process 15257 was started by sandbox2 on n015.cluster.edu,
% 0.44/1.07 Tue Jul 12 09:16:41 2022
% 0.44/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14878_n015.cluster.edu".
% 0.44/1.07 ============================== end of head ===========================
% 0.44/1.07
% 0.44/1.07 ============================== INPUT =================================
% 0.44/1.07
% 0.44/1.07 % Reading from file /tmp/Prover9_14878_n015.cluster.edu
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(auto2).
% 0.44/1.07 % set(auto2) -> set(auto).
% 0.44/1.07 % set(auto) -> set(auto_inference).
% 0.44/1.07 % set(auto) -> set(auto_setup).
% 0.44/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.07 % set(auto) -> set(auto_limits).
% 0.44/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.07 % set(auto) -> set(auto_denials).
% 0.44/1.07 % set(auto) -> set(auto_process).
% 0.44/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.07 % set(auto2) -> assign(stats, some).
% 0.44/1.07 % set(auto2) -> clear(echo_input).
% 0.44/1.07 % set(auto2) -> set(quiet).
% 0.44/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.07 % set(auto2) -> clear(print_given).
% 0.44/1.07 assign(lrs_ticks,-1).
% 0.44/1.07 assign(sos_limit,10000).
% 0.44/1.07 assign(order,kbo).
% 0.44/1.07 set(lex_order_vars).
% 0.44/1.07 clear(print_given).
% 0.44/1.07
% 0.44/1.07 % formulas(sos). % not echoed (4 formulas)
% 0.44/1.07
% 0.44/1.07 ============================== end of input ==========================
% 0.44/1.07
% 0.44/1.07 % From the command line: assign(max_seconds, 300).
% 0.44/1.07
% 0.44/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.07
% 0.44/1.07 % Formulas that are not ordinary clauses:
% 0.44/1.07 1 (all X exists Y big_f(X,Y)) # label(pel36_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 2 (all X exists Y big_g(X,Y)) # label(pel36_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 3 (all X all Y (big_f(X,Y) | big_g(X,Y) -> (all Z (big_f(Y,Z) | big_g(Y,Z) -> big_h(X,Z))))) # label(pel36_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 4 -(all X exists Y big_h(X,Y)) # label(pel36) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.07
% 0.44/1.07 ============================== end of process non-clausal formulas ===
% 0.44/1.07
% 0.44/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.07
% 0.44/1.07 ============================== PREDICATE ELIMINATION =================
% 0.44/1.07 5 -big_f(A,B) | -big_f(B,C) | big_h(A,C) # label(pel36_3) # label(axiom). [clausify(3)].
% 0.44/1.07 6 -big_h(c1,A) # label(pel36) # label(negated_conjecture). [clausify(4)].
% 0.44/1.07 Derived: -big_f(c1,A) | -big_f(A,B). [resolve(5,c,6,a)].
% 0.44/1.07 7 -big_f(A,B) | -big_g(B,C) | big_h(A,C) # label(pel36_3) # label(axiom). [clausify(3)].
% 0.44/1.07 Derived: -big_f(c1,A) | -big_g(A,B). [resolve(7,c,6,a)].
% 0.44/1.07 8 -big_g(A,B) | -big_f(B,C) | big_h(A,C) # label(pel36_3) # label(axiom). [clausify(3)].
% 0.44/1.07 Derived: -big_g(c1,A) | -big_f(A,B). [resolve(8,c,6,a)].
% 0.44/1.07 9 -big_g(A,B) | -big_g(B,C) | big_h(A,C) # label(pel36_3) # label(axiom). [clausify(3)].
% 0.44/1.07 Derived: -big_g(c1,A) | -big_g(A,B). [resolve(9,c,6,a)].
% 0.44/1.07
% 0.44/1.07 ============================== end predicate elimination =============
% 0.44/1.07
% 0.44/1.07 Auto_denials:
% 0.44/1.07 % assign(max_proofs, 4). % (Horn set with more than one neg. clause)
% 0.44/1.07
% 0.44/1.07 WARNING, because some of the denials share constants,
% 0.44/1.07 some of the denials or their descendents may be subsumed,
% 0.44/1.07 preventing the target number of proofs from being found.
% 0.44/1.07 The shared constants are: c1.
% 0.44/1.07
% 0.44/1.07 Term ordering decisions:
% 0.44/1.07 Function symbol KB weights: c1=1. f1=1. f2=1.
% 0.44/1.07
% 0.44/1.07 ============================== end of process initial clauses ========
% 0.44/1.07
% 0.44/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.07
% 0.44/1.07 ============================== end of clauses for search =============
% 0.44/1.07
% 0.44/1.07 ============================== SEARCH ================================
% 0.44/1.07
% 0.44/1.07 % Starting search at 0.01 seconds.
% 0.44/1.07
% 0.44/1.07 ============================== PROOF =================================
% 0.44/1.07 % SZS status Theorem
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/1.07 % Length of proof is 9.
% 0.44/1.07 % Level of proof is 4.
% 0.44/1.07 % Maximum clause weight is 6.000.
% 0.44/1.07 % Given clauses 3.
% 0.44/1.07
% 0.44/1.07 1 (all X exists Y big_f(X,Y)) # label(pel36_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 3 (all X all Y (big_f(X,Y) | big_g(X,Y) -> (all Z (big_f(Y,Z) | big_g(Y,Z) -> big_h(X,Z))))) # label(pel36_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.07 4 -(all X exists Y big_h(X,Y)) # label(pel36) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.07 5 -big_f(A,B) | -big_f(B,C) | big_h(A,C) # label(pel36_3) # label(axiom). [clausify(3)].
% 0.44/1.07 6 -big_h(c1,A) # label(pel36) # label(negated_conjecture). [clausify(4)].
% 0.44/1.07 10 big_f(A,f1(A)) # label(pel36_1) # label(axiom). [clausify(1)].
% 0.44/1.07 12 -big_f(c1,A) | -big_f(A,B). [resolve(5,c,6,a)].
% 0.44/1.07 16 -big_f(f1(c1),A). [resolve(12,a,10,a)].
% 0.44/1.07 17 $F. [resolve(16,a,10,a)].
% 0.44/1.07
% 0.44/1.07 % SZS output end Refutation
% 0.44/1.07 ============================== end of proof ==========================
% 0.44/1.07 % Redundant proof: 19 $F. [resolve(18,a,10,a)].
% 0.44/1.07
% 0.44/1.07 % Disable descendants (x means already disabled):
% 0.44/1.07 0x 6x 12x 13x 14 15 16 18
% 0.44/1.07
% 0.44/1.07 ============================== STATISTICS ============================
% 0.44/1.07
% 0.44/1.07 Given=3. Generated=10. Kept=8. proofs=1.
% 0.44/1.07 Usable=2. Sos=0. Demods=0. Limbo=0, Disabled=17. Hints=0.
% 0.44/1.07 Megabytes=0.03.
% 0.44/1.07 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/1.07
% 0.44/1.07 ============================== end of statistics =====================
% 0.44/1.07
% 0.44/1.07 ============================== end of search =========================
% 0.44/1.07
% 0.44/1.07 SEARCH FAILED
% 0.44/1.07
% 0.44/1.07 Exiting with 1 proof.
% 0.44/1.07
% 0.44/1.07 Process 15257 exit (sos_empty) Tue Jul 12 09:16:41 2022
% 0.44/1.07 Prover9 interrupted
%------------------------------------------------------------------------------