TSTP Solution File: SYN066+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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.65s 0.91s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 09:22:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/0.91 ============================== Prover9 ===============================
% 0.65/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.91 Process 2705 was started by sandbox on n027.cluster.edu,
% 0.65/0.91 Tue Jul 12 09:22:20 2022
% 0.65/0.91 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2366_n027.cluster.edu".
% 0.65/0.91 ============================== end of head ===========================
% 0.65/0.91
% 0.65/0.91 ============================== INPUT =================================
% 0.65/0.91
% 0.65/0.91 % Reading from file /tmp/Prover9_2366_n027.cluster.edu
% 0.65/0.91
% 0.65/0.91 set(prolog_style_variables).
% 0.65/0.91 set(auto2).
% 0.65/0.91 % set(auto2) -> set(auto).
% 0.65/0.91 % set(auto) -> set(auto_inference).
% 0.65/0.91 % set(auto) -> set(auto_setup).
% 0.65/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.91 % set(auto) -> set(auto_limits).
% 0.65/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.91 % set(auto) -> set(auto_denials).
% 0.65/0.91 % set(auto) -> set(auto_process).
% 0.65/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.91 % set(auto2) -> assign(stats, some).
% 0.65/0.91 % set(auto2) -> clear(echo_input).
% 0.65/0.91 % set(auto2) -> set(quiet).
% 0.65/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.91 % set(auto2) -> clear(print_given).
% 0.65/0.91 assign(lrs_ticks,-1).
% 0.65/0.91 assign(sos_limit,10000).
% 0.65/0.91 assign(order,kbo).
% 0.65/0.91 set(lex_order_vars).
% 0.65/0.91 clear(print_given).
% 0.65/0.91
% 0.65/0.91 % formulas(sos). % not echoed (4 formulas)
% 0.65/0.91
% 0.65/0.91 ============================== end of input ==========================
% 0.65/0.91
% 0.65/0.91 % From the command line: assign(max_seconds, 300).
% 0.65/0.91
% 0.65/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.91
% 0.65/0.91 % Formulas that are not ordinary clauses:
% 0.65/0.91 1 (all Z exists W all X exists Y ((big_p(X,Z) -> big_p(Y,W)) & big_p(Y,Z) & (big_p(Y,W) -> (exists U big_q(U,W))))) # label(pel37_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 2 (all X all Z (-big_p(X,Z) -> (exists Y big_q(Y,Z)))) # label(pel37_2) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 3 (exists X exists Y big_q(X,Y)) -> (all Z big_r(Z,Z)) # label(pel37_3) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 4 -(all X exists Y big_r(X,Y)) # label(pel37) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.91
% 0.65/0.91 ============================== end of process non-clausal formulas ===
% 0.65/0.91
% 0.65/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.91
% 0.65/0.91 ============================== PREDICATE ELIMINATION =================
% 0.65/0.91 5 -big_q(A,B) | big_r(C,C) # label(pel37_3) # label(axiom). [clausify(3)].
% 0.65/0.91 6 big_p(A,B) | big_q(f4(A,B),B) # label(pel37_2) # label(axiom). [clausify(2)].
% 0.65/0.91 Derived: big_r(A,A) | big_p(B,C). [resolve(5,a,6,b)].
% 0.65/0.91 7 -big_p(f2(A,B),f1(A)) | big_q(f3(A,B),f1(A)) # label(pel37_1) # label(axiom). [clausify(1)].
% 0.65/0.91 Derived: -big_p(f2(A,B),f1(A)) | big_r(C,C). [resolve(7,b,5,a)].
% 0.65/0.91 8 big_r(A,A) | big_p(B,C). [resolve(5,a,6,b)].
% 0.65/0.91 9 -big_r(c1,A) # label(pel37) # label(negated_conjecture). [clausify(4)].
% 0.65/0.91 Derived: big_p(A,B). [resolve(8,a,9,a)].
% 0.65/0.91 10 -big_p(f2(A,B),f1(A)) | big_r(C,C). [resolve(7,b,5,a)].
% 0.65/0.91 Derived: -big_p(f2(A,B),f1(A)). [resolve(10,b,9,a)].
% 0.65/0.91
% 0.65/0.91 ============================== end predicate elimination =============
% 0.65/0.91
% 0.65/0.91 Auto_denials: (no changes).
% 0.65/0.91
% 0.65/0.91 Term ordering decisions:
% 0.65/0.91
% 0.65/0.91 % Assigning unary symbol f1 kb_weight 0 and highest precedence (3).
% 0.65/0.91 Function symbol KB weights: f2=1. f1=0.
% 0.65/0.91
% 0.65/0.91 ============================== PROOF =================================
% 0.65/0.91 % SZS status Theorem
% 0.65/0.91 % SZS output start Refutation
% 0.65/0.91
% 0.65/0.91 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.65/0.91 % Length of proof is 13.
% 0.65/0.91 % Level of proof is 4.
% 0.65/0.91 % Maximum clause weight is 6.000.
% 0.65/0.91 % Given clauses 0.
% 0.65/0.91
% 0.65/0.91 1 (all Z exists W all X exists Y ((big_p(X,Z) -> big_p(Y,W)) & big_p(Y,Z) & (big_p(Y,W) -> (exists U big_q(U,W))))) # label(pel37_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 2 (all X all Z (-big_p(X,Z) -> (exists Y big_q(Y,Z)))) # label(pel37_2) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 3 (exists X exists Y big_q(X,Y)) -> (all Z big_r(Z,Z)) # label(pel37_3) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.91 4 -(all X exists Y big_r(X,Y)) # label(pel37) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.91 5 -big_q(A,B) | big_r(C,C) # label(pel37_3) # label(axiom). [clausify(3)].
% 0.65/0.91 6 big_p(A,B) | big_q(f4(A,B),B) # label(pel37_2) # label(axiom). [clausify(2)].
% 0.65/0.91 7 -big_p(f2(A,B),f1(A)) | big_q(f3(A,B),f1(A)) # label(pel37_1) # label(axiom). [clausify(1)].
% 0.65/0.91 8 big_r(A,A) | big_p(B,C). [resolve(5,a,6,b)].
% 0.65/0.91 9 -big_r(c1,A) # label(pel37) # label(negated_conjecture). [clausify(4)].
% 0.65/0.91 10 -big_p(f2(A,B),f1(A)) | big_r(C,C). [resolve(7,b,5,a)].
% 0.65/0.91 13 big_p(A,B). [resolve(8,a,9,a)].
% 0.65/0.91 14 -big_p(f2(A,B),f1(A)). [resolve(10,b,9,a)].
% 0.65/0.91 15 $F. [resolve(14,a,13,a)].
% 0.65/0.91
% 0.65/0.91 % SZS output end Refutation
% 0.65/0.91 ============================== end of proof ==========================
% 0.65/0.91
% 0.65/0.91 ============================== STATISTICS ============================
% 0.65/0.91
% 0.65/0.91 Given=0. Generated=4. Kept=4. proofs=1.
% 0.65/0.91 Usable=0. Sos=0. Demods=0. Limbo=3, Disabled=10. Hints=0.
% 0.65/0.91 Megabytes=0.03.
% 0.65/0.91 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.65/0.91
% 0.65/0.91 ============================== end of statistics =====================
% 0.65/0.91
% 0.65/0.91 ============================== end of search =========================
% 0.65/0.91
% 0.65/0.91 THEOREM PROVED
% 0.65/0.91 % SZS status Theorem
% 0.65/0.91
% 0.65/0.91 Exiting with 1 proof.
% 0.65/0.91
% 0.65/0.91 Process 2705 exit (max_proofs) Tue Jul 12 09:22:20 2022
% 0.65/0.91 Prover9 interrupted
%------------------------------------------------------------------------------