TSTP Solution File: SWV488+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.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 : Wed Jul 20 21:13:14 EDT 2022
% Result : Theorem 0.78s 1.07s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n028.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 : Thu Jun 16 00:43:41 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.78/1.04 ============================== Prover9 ===============================
% 0.78/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.78/1.04 Process 10511 was started by sandbox2 on n028.cluster.edu,
% 0.78/1.04 Thu Jun 16 00:43:41 2022
% 0.78/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10358_n028.cluster.edu".
% 0.78/1.04 ============================== end of head ===========================
% 0.78/1.04
% 0.78/1.04 ============================== INPUT =================================
% 0.78/1.04
% 0.78/1.04 % Reading from file /tmp/Prover9_10358_n028.cluster.edu
% 0.78/1.04
% 0.78/1.04 set(prolog_style_variables).
% 0.78/1.04 set(auto2).
% 0.78/1.04 % set(auto2) -> set(auto).
% 0.78/1.04 % set(auto) -> set(auto_inference).
% 0.78/1.04 % set(auto) -> set(auto_setup).
% 0.78/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.78/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.78/1.04 % set(auto) -> set(auto_limits).
% 0.78/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.78/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.78/1.04 % set(auto) -> set(auto_denials).
% 0.78/1.04 % set(auto) -> set(auto_process).
% 0.78/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.78/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.78/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.78/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.78/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.78/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.78/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.78/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.78/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.78/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.78/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.78/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.78/1.04 % set(auto2) -> assign(stats, some).
% 0.78/1.04 % set(auto2) -> clear(echo_input).
% 0.78/1.04 % set(auto2) -> set(quiet).
% 0.78/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.78/1.04 % set(auto2) -> clear(print_given).
% 0.78/1.04 assign(lrs_ticks,-1).
% 0.78/1.04 assign(sos_limit,10000).
% 0.78/1.04 assign(order,kbo).
% 0.78/1.04 set(lex_order_vars).
% 0.78/1.04 clear(print_given).
% 0.78/1.04
% 0.78/1.04 % formulas(sos). % not echoed (13 formulas)
% 0.78/1.04
% 0.78/1.04 ============================== end of input ==========================
% 0.78/1.04
% 0.78/1.04 % From the command line: assign(max_seconds, 300).
% 0.78/1.04
% 0.78/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.78/1.04
% 0.78/1.04 % Formulas that are not ordinary clauses:
% 0.78/1.04 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.78/1.04 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.78/1.04 3 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 5 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 6 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.04 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.78/1.04 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.78/1.04 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.78/1.04 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) = real_zero)))) & (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(qii) # label(hypothesis) # label(non_clause). [assumption].
% 0.78/1.04 11 -(all I all J (int_leq(int_one,J) & int_leq(J,I) & int_leq(I,n) -> (I = J -> a(I,J) != real_zero))) # label(uti) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.04
% 0.78/1.04 ============================== end of process non-clausal formulas ===
% 0.78/1.04
% 0.78/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.78/1.07
% 0.78/1.07 ============================== PREDICATE ELIMINATION =================
% 0.78/1.07
% 0.78/1.07 ============================== end predicate elimination =============
% 0.78/1.07
% 0.78/1.07 Auto_denials: (non-Horn, no changes).
% 0.78/1.07
% 0.78/1.07 Term ordering decisions:
% 0.78/1.07 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. f1=1.
% 0.78/1.07
% 0.78/1.07 ============================== end of process initial clauses ========
% 0.78/1.07
% 0.78/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.78/1.07
% 0.78/1.07 ============================== end of clauses for search =============
% 0.78/1.07
% 0.78/1.07 ============================== SEARCH ================================
% 0.78/1.07
% 0.78/1.07 % Starting search at 0.02 seconds.
% 0.78/1.07
% 0.78/1.07 ============================== PROOF =================================
% 0.78/1.07 % SZS status Theorem
% 0.78/1.07 % SZS output start Refutation
% 0.78/1.07
% 0.78/1.07 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.78/1.07 % Length of proof is 19.
% 0.78/1.07 % Level of proof is 4.
% 0.78/1.07 % Maximum clause weight is 23.000.
% 0.78/1.07 % Given clauses 23.
% 0.78/1.07
% 0.78/1.07 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.78/1.07 4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption].
% 0.78/1.07 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) = real_zero)))) & (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(qii) # label(hypothesis) # label(non_clause). [assumption].
% 0.78/1.07 11 -(all I all J (int_leq(int_one,J) & int_leq(J,I) & int_leq(I,n) -> (I = J -> a(I,J) != real_zero))) # label(uti) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.78/1.07 13 int_leq(int_one,c2) # label(uti) # label(negated_conjecture). [clausify(11)].
% 0.78/1.07 15 int_leq(c1,n) # label(uti) # label(negated_conjecture). [clausify(11)].
% 0.78/1.07 16 c2 = c1 # label(uti) # label(negated_conjecture). [clausify(11)].
% 0.78/1.07 18 a(c1,c2) = real_zero # label(uti) # label(negated_conjecture). [clausify(11)].
% 0.78/1.07 19 real_zero = a(c1,c1). [copy(18),rewrite([16(2)]),flip(a)].
% 0.78/1.07 20 int_less(A,B) | int_leq(B,A) # label(int_less_total) # label(axiom). [clausify(4)].
% 0.78/1.07 22 real_zero != real_one # label(real_constants) # label(axiom). [assumption].
% 0.78/1.07 23 a(c1,c1) != real_one. [copy(22),rewrite([19(1)])].
% 0.78/1.07 25 int_leq(A,B) | -int_less(A,B) # label(int_leq) # label(axiom). [clausify(1)].
% 0.78/1.07 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(qii) # label(hypothesis). [clausify(10)].
% 0.78/1.07 41 int_leq(int_one,c1). [back_rewrite(13),rewrite([16(2)])].
% 0.78/1.07 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.78/1.07 95 int_leq(A,B) | int_leq(B,A). [resolve(25,b,20,a)].
% 0.78/1.07 97 int_leq(A,A). [factor(95,a,b)].
% 0.78/1.07 248 $F. [ur(42,a,41,a,b,15,a,c,41,a,e,23,a),unit_del(a,97)].
% 0.78/1.07
% 0.78/1.07 % SZS output end Refutation
% 0.78/1.07 ============================== end of proof ==========================
% 0.78/1.07
% 0.78/1.07 ============================== STATISTICS ============================
% 0.78/1.07
% 0.78/1.07 Given=23. Generated=544. Kept=232. proofs=1.
% 0.78/1.07 Usable=23. Sos=156. Demods=6. Limbo=4, Disabled=73. Hints=0.
% 0.78/1.07 Megabytes=0.29.
% 0.78/1.07 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.78/1.07
% 0.78/1.07 ============================== end of statistics =====================
% 0.78/1.07
% 0.78/1.07 ============================== end of search =========================
% 0.78/1.07
% 0.78/1.07 THEOREM PROVED
% 0.78/1.07 % SZS status Theorem
% 0.78/1.07
% 0.78/1.07 Exiting with 1 proof.
% 0.78/1.07
% 0.78/1.07 Process 10511 exit (max_proofs) Thu Jun 16 00:43:41 2022
% 0.78/1.07 Prover9 interrupted
%------------------------------------------------------------------------------