TSTP Solution File: SYN986+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:24:03 EDT 2022
% Result : Theorem 0.49s 1.06s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 23:20:35 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 16860 was started by sandbox on n006.cluster.edu,
% 0.49/1.06 Mon Jul 11 23:20:36 2022
% 0.49/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16706_n006.cluster.edu".
% 0.49/1.06 ============================== end of head ===========================
% 0.49/1.06
% 0.49/1.06 ============================== INPUT =================================
% 0.49/1.06
% 0.49/1.06 % Reading from file /tmp/Prover9_16706_n006.cluster.edu
% 0.49/1.06
% 0.49/1.06 set(prolog_style_variables).
% 0.49/1.06 set(auto2).
% 0.49/1.06 % set(auto2) -> set(auto).
% 0.49/1.06 % set(auto) -> set(auto_inference).
% 0.49/1.06 % set(auto) -> set(auto_setup).
% 0.49/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.06 % set(auto) -> set(auto_limits).
% 0.49/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.06 % set(auto) -> set(auto_denials).
% 0.49/1.06 % set(auto) -> set(auto_process).
% 0.49/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.06 % set(auto2) -> assign(stats, some).
% 0.49/1.06 % set(auto2) -> clear(echo_input).
% 0.49/1.06 % set(auto2) -> set(quiet).
% 0.49/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.06 % set(auto2) -> clear(print_given).
% 0.49/1.06 assign(lrs_ticks,-1).
% 0.49/1.06 assign(sos_limit,10000).
% 0.49/1.06 assign(order,kbo).
% 0.49/1.06 set(lex_order_vars).
% 0.49/1.06 clear(print_given).
% 0.49/1.06
% 0.49/1.06 % formulas(sos). % not echoed (3 formulas)
% 0.49/1.06
% 0.49/1.06 ============================== end of input ==========================
% 0.49/1.06
% 0.49/1.06 % From the command line: assign(max_seconds, 300).
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.06
% 0.49/1.06 % Formulas that are not ordinary clauses:
% 0.49/1.06 1 (all Y r(Y,zero,succ(Y))) # label(hyp1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 2 (all Y all X all Z all Z1 (r(Y,X,Z) -> (r(Z,X,Z1) -> r(Y,succ(X),Z1)))) # label(hyp2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 3 -(exists Z1 exists Z0 (r(zero,zero,Z1) & r(zero,Z1,Z0))) # label(ck) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/1.06
% 0.49/1.06 ============================== end of process non-clausal formulas ===
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.06
% 0.49/1.06 ============================== PREDICATE ELIMINATION =================
% 0.49/1.06
% 0.49/1.06 ============================== end predicate elimination =============
% 0.49/1.06
% 0.49/1.06 Auto_denials:
% 0.49/1.06 % copying label ck to answer in negative clause
% 0.49/1.06
% 0.49/1.06 Term ordering decisions:
% 0.49/1.06
% 0.49/1.06 % Assigning unary symbol succ kb_weight 0 and highest precedence (3).
% 0.49/1.06 Function symbol KB weights: zero=1. succ=0.
% 0.49/1.06
% 0.49/1.06 ============================== end of process initial clauses ========
% 0.49/1.06
% 0.49/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.49/1.06
% 0.49/1.06 ============================== end of clauses for search =============
% 0.49/1.06
% 0.49/1.06 ============================== SEARCH ================================
% 0.49/1.06
% 0.49/1.06 % Starting search at 0.01 seconds.
% 0.49/1.06
% 0.49/1.06 ============================== PROOF =================================
% 0.49/1.06 % SZS status Theorem
% 0.49/1.06 % SZS output start Refutation
% 0.49/1.06
% 0.49/1.06 % Proof 1 at 0.01 (+ 0.00) seconds: ck.
% 0.49/1.06 % Length of proof is 9.
% 0.49/1.06 % Level of proof is 3.
% 0.49/1.06 % Maximum clause weight is 13.000.
% 0.49/1.06 % Given clauses 3.
% 0.49/1.06
% 0.49/1.06 1 (all Y r(Y,zero,succ(Y))) # label(hyp1) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 2 (all Y all X all Z all Z1 (r(Y,X,Z) -> (r(Z,X,Z1) -> r(Y,succ(X),Z1)))) # label(hyp2) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 3 -(exists Z1 exists Z0 (r(zero,zero,Z1) & r(zero,Z1,Z0))) # label(ck) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/1.06 4 r(A,zero,succ(A)) # label(hyp1) # label(axiom). [clausify(1)].
% 0.49/1.06 5 -r(zero,zero,A) | -r(zero,A,B) # label(ck) # label(negated_conjecture) # answer(ck). [clausify(3)].
% 0.49/1.06 6 -r(A,B,C) | -r(C,B,D) | r(A,succ(B),D) # label(hyp2) # label(axiom). [clausify(2)].
% 0.49/1.06 7 -r(zero,succ(zero),A) # answer(ck). [resolve(5,a,4,a)].
% 0.49/1.06 10 r(A,succ(zero),succ(succ(A))). [ur(6,a,4,a,b,4,a)].
% 0.49/1.06 11 $F # answer(ck). [resolve(10,a,7,a)].
% 0.49/1.06
% 0.49/1.06 % SZS output end Refutation
% 0.49/1.06 ============================== end of proof ==========================
% 0.49/1.06
% 0.49/1.06 ============================== STATISTICS ============================
% 0.49/1.06
% 0.49/1.06 Given=3. Generated=9. Kept=7. proofs=1.
% 0.49/1.06 Usable=3. Sos=2. Demods=0. Limbo=1, Disabled=3. Hints=0.
% 0.49/1.06 Megabytes=0.03.
% 0.49/1.06 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.49/1.06
% 0.49/1.06 ============================== end of statistics =====================
% 0.49/1.06
% 0.49/1.06 ============================== end of search =========================
% 0.49/1.06
% 0.49/1.06 THEOREM PROVED
% 0.49/1.06 % SZS status Theorem
% 0.49/1.06
% 0.49/1.06 Exiting with 1 proof.
% 0.49/1.06
% 0.49/1.06 Process 16860 exit (max_proofs) Mon Jul 11 23:20:36 2022
% 0.49/1.06 Prover9 interrupted
%------------------------------------------------------------------------------