TSTP Solution File: SWV488+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 : Wed Jul 20 21:13:14 EDT 2022
% Result : Theorem 0.74s 1.03s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV488+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 15 15:19:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 32655 was started by sandbox2 on n008.cluster.edu,
% 0.45/1.00 Wed Jun 15 15:19:08 2022
% 0.45/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32483_n008.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_32483_n008.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (13 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00 1 (all I all J (int_leq(I,J) <-> int_less(I,J) | I = J)) # label(int_leq) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 2 (all I all J all K (int_less(I,J) & int_less(J,K) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 3 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 5 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 6 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 7 (all I1 all J1 all I2 all J2 (int_less(I1,J1) & int_leq(I2,J2) -> int_leq(plus(I1,I2),plus(J1,J2)))) # label(plus_and_order1) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 8 (all I all J (int_less(I,J) <-> (exists K (plus(I,K) = J & int_less(int_zero,K))))) # label(plus_and_inverse) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 9 (all I (int_less(int_zero,I) <-> int_leq(int_one,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 10 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> a(plus(K,C),K) = lu(plus(K,C),K))))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> a(K,K) = real_one)) & (all C (int_less(int_zero,C) & J = plus(I,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> a(K,plus(K,C)) = real_zero)))))) # label(qil) # label(hypothesis) # label(non_clause). [assumption].
% 0.45/1.00 11 -(all I all J (int_leq(int_one,I) & int_leq(I,J) & int_leq(J,n) -> (I = J -> a(I,J) != real_zero))) # label(lti) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.03
% 0.74/1.03 ============================== PREDICATE ELIMINATION =================
% 0.74/1.03
% 0.74/1.03 ============================== end predicate elimination =============
% 0.74/1.03
% 0.74/1.03 Auto_denials: (non-Horn, no changes).
% 0.74/1.03
% 0.74/1.03 Term ordering decisions:
% 0.74/1.03 Function symbol KB weights: int_one=1. int_zero=1. n=1. real_zero=1. real_one=1. c1=1. c2=1. plus=1. a=1. lu=1. f1=1.
% 0.74/1.03
% 0.74/1.03 ============================== end of process initial clauses ========
% 0.74/1.03
% 0.74/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.03
% 0.74/1.03 ============================== end of clauses for search =============
% 0.74/1.03
% 0.74/1.03 ============================== SEARCH ================================
% 0.74/1.03
% 0.74/1.03 % Starting search at 0.02 seconds.
% 0.74/1.03
% 0.74/1.03 ============================== PROOF =================================
% 0.74/1.03 % SZS status Theorem
% 0.74/1.03 % SZS output start Refutation
% 0.74/1.03
% 0.74/1.03 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.74/1.03 % Length of proof is 19.
% 0.74/1.03 % Level of proof is 4.
% 0.74/1.03 % Maximum clause weight is 23.000.
% 0.74/1.03 % Given clauses 23.
% 0.74/1.03
% 0.74/1.03 1 (all I all J (int_leq(I,J) <-> int_less(I,J) | I = J)) # label(int_leq) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.03 10 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> a(plus(K,C),K) = lu(plus(K,C),K))))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> a(K,K) = real_one)) & (all C (int_less(int_zero,C) & J = plus(I,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> a(K,plus(K,C)) = real_zero)))))) # label(qil) # label(hypothesis) # label(non_clause). [assumption].
% 0.74/1.03 11 -(all I all J (int_leq(int_one,I) & int_leq(I,J) & int_leq(J,n) -> (I = J -> a(I,J) != real_zero))) # label(lti) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.03 13 int_leq(int_one,c1) # label(lti) # label(negated_conjecture). [clausify(11)].
% 0.74/1.03 15 int_leq(c2,n) # label(lti) # label(negated_conjecture). [clausify(11)].
% 0.74/1.03 16 c2 = c1 # label(lti) # label(negated_conjecture). [clausify(11)].
% 0.74/1.03 18 a(c1,c2) = real_zero # label(lti) # label(negated_conjecture). [clausify(11)].
% 0.74/1.03 19 real_zero = a(c1,c1). [copy(18),rewrite([16(2)]),flip(a)].
% 0.74/1.03 20 int_less(A,B) | int_leq(B,A) # label(int_less_total) # label(axiom). [clausify(4)].
% 0.74/1.03 22 real_zero != real_one # label(real_constants) # label(axiom). [assumption].
% 0.74/1.03 23 a(c1,c1) != real_one. [copy(22),rewrite([19(1)])].
% 0.74/1.03 25 int_leq(A,B) | -int_less(A,B) # label(int_leq) # label(axiom). [clausify(1)].
% 0.74/1.03 35 -int_leq(int_one,A) | -int_leq(A,n) | -int_leq(int_one,B) | -int_leq(B,n) | -int_leq(int_one,C) | -int_leq(C,B) | a(C,C) = real_one # label(qil) # label(hypothesis). [clausify(10)].
% 0.74/1.03 40 int_leq(c1,n). [back_rewrite(15),rewrite([16(1)])].
% 0.74/1.03 42 -int_leq(int_one,A) | -int_leq(A,n) | -int_leq(int_one,B) | -int_leq(B,A) | a(B,B) = real_one. [factor(35,a,c),merge(c)].
% 0.74/1.03 95 int_leq(A,B) | int_leq(B,A). [resolve(25,b,20,a)].
% 0.74/1.03 97 int_leq(A,A). [factor(95,a,b)].
% 0.74/1.03 248 $F. [ur(42,a,13,a,b,40,a,c,13,a,e,23,a),unit_del(a,97)].
% 0.74/1.03
% 0.74/1.03 % SZS output end Refutation
% 0.74/1.03 ============================== end of proof ==========================
% 0.74/1.03
% 0.74/1.03 ============================== STATISTICS ============================
% 0.74/1.03
% 0.74/1.03 Given=23. Generated=544. Kept=232. proofs=1.
% 0.74/1.03 Usable=23. Sos=156. Demods=6. Limbo=4, Disabled=73. Hints=0.
% 0.74/1.03 Megabytes=0.33.
% 0.74/1.03 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.74/1.03
% 0.74/1.03 ============================== end of statistics =====================
% 0.74/1.03
% 0.74/1.03 ============================== end of search =========================
% 0.74/1.03
% 0.74/1.03 THEOREM PROVED
% 0.74/1.03 % SZS status Theorem
% 0.74/1.03
% 0.74/1.03 Exiting with 1 proof.
% 0.74/1.03
% 0.74/1.03 Process 32655 exit (max_proofs) Wed Jun 15 15:19:08 2022
% 0.74/1.03 Prover9 interrupted
%------------------------------------------------------------------------------