TSTP Solution File: ALG178+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 14 17:53:57 EDT 2022
% Result : Theorem 0.41s 0.96s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 : Wed Jun 8 14:27:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.96 ============================== Prover9 ===============================
% 0.41/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96 Process 20831 was started by sandbox2 on n024.cluster.edu,
% 0.41/0.96 Wed Jun 8 14:27:35 2022
% 0.41/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20678_n024.cluster.edu".
% 0.41/0.96 ============================== end of head ===========================
% 0.41/0.96
% 0.41/0.96 ============================== INPUT =================================
% 0.41/0.96
% 0.41/0.96 % Reading from file /tmp/Prover9_20678_n024.cluster.edu
% 0.41/0.96
% 0.41/0.96 set(prolog_style_variables).
% 0.41/0.96 set(auto2).
% 0.41/0.96 % set(auto2) -> set(auto).
% 0.41/0.96 % set(auto) -> set(auto_inference).
% 0.41/0.96 % set(auto) -> set(auto_setup).
% 0.41/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96 % set(auto) -> set(auto_limits).
% 0.41/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96 % set(auto) -> set(auto_denials).
% 0.41/0.96 % set(auto) -> set(auto_process).
% 0.41/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96 % set(auto2) -> assign(stats, some).
% 0.41/0.96 % set(auto2) -> clear(echo_input).
% 0.41/0.96 % set(auto2) -> set(quiet).
% 0.41/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96 % set(auto2) -> clear(print_given).
% 0.41/0.96 assign(lrs_ticks,-1).
% 0.41/0.96 assign(sos_limit,10000).
% 0.41/0.96 assign(order,kbo).
% 0.41/0.96 set(lex_order_vars).
% 0.41/0.96 clear(print_given).
% 0.41/0.96
% 0.41/0.96 % formulas(sos). % not echoed (5 formulas)
% 0.41/0.96
% 0.41/0.96 ============================== end of input ==========================
% 0.41/0.96
% 0.41/0.96 % From the command line: assign(max_seconds, 300).
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96
% 0.41/0.96 % Formulas that are not ordinary clauses:
% 0.41/0.96 1 (all U (sorti1(U) -> (all V (sorti1(V) -> sorti1(op1(U,V)))))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 2 (all U (sorti2(U) -> (all V (sorti2(V) -> sorti2(op2(U,V)))))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 3 (all U (sorti1(U) -> (all V (sorti1(V) -> op1(U,op1(U,V)) = V)))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 4 -(all U (sorti2(U) -> (all V (sorti2(V) -> op2(U,op2(U,V)) = V)))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 5 -((all U (sorti1(U) -> sorti2(h(U)))) & (all V (sorti2(V) -> sorti1(j(V)))) -> -((all W (sorti1(W) -> (all X (sorti1(X) -> h(op1(W,X)) = op2(h(W),h(X)))))) & (all Y (sorti2(Y) -> (all Z (sorti2(Z) -> j(op2(Y,Z)) = op1(j(Y),j(Z)))))) & (all X1 (sorti2(X1) -> h(j(X1)) = X1)) & (all X2 (sorti1(X2) -> j(h(X2)) = X2)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.96
% 0.41/0.96 ============================== end of process non-clausal formulas ===
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96
% 0.41/0.96 ============================== PREDICATE ELIMINATION =================
% 0.41/0.96
% 0.41/0.96 ============================== end predicate elimination =============
% 0.41/0.96
% 0.41/0.96 Auto_denials:
% 0.41/0.96 % copying label ax4 to answer in negative clause
% 0.41/0.96
% 0.41/0.96 Term ordering decisions:
% 0.41/0.96 Function symbol KB weights: c1=1. c2=1. op1=1. op2=1. h=1. j=1.
% 0.41/0.96
% 0.41/0.96 ============================== end of process initial clauses ========
% 0.41/0.96
% 0.41/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.96
% 0.41/0.96 ============================== end of clauses for search =============
% 0.41/0.96
% 0.41/0.96 ============================== SEARCH ================================
% 0.41/0.96
% 0.41/0.96 % Starting search at 0.01 seconds.
% 0.41/0.96
% 0.41/0.96 ============================== PROOF =================================
% 0.41/0.96 % SZS status Theorem
% 0.41/0.96 % SZS output start Refutation
% 0.41/0.96
% 0.41/0.96 % Proof 1 at 0.02 (+ 0.00) seconds: ax4.
% 0.41/0.96 % Length of proof is 25.
% 0.41/0.96 % Level of proof is 6.
% 0.41/0.96 % Maximum clause weight is 14.000.
% 0.41/0.96 % Given clauses 25.
% 0.41/0.96
% 0.41/0.96 1 (all U (sorti1(U) -> (all V (sorti1(V) -> sorti1(op1(U,V)))))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 3 (all U (sorti1(U) -> (all V (sorti1(V) -> op1(U,op1(U,V)) = V)))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 4 -(all U (sorti2(U) -> (all V (sorti2(V) -> op2(U,op2(U,V)) = V)))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.41/0.96 5 -((all U (sorti1(U) -> sorti2(h(U)))) & (all V (sorti2(V) -> sorti1(j(V)))) -> -((all W (sorti1(W) -> (all X (sorti1(X) -> h(op1(W,X)) = op2(h(W),h(X)))))) & (all Y (sorti2(Y) -> (all Z (sorti2(Z) -> j(op2(Y,Z)) = op1(j(Y),j(Z)))))) & (all X1 (sorti2(X1) -> h(j(X1)) = X1)) & (all X2 (sorti1(X2) -> j(h(X2)) = X2)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.41/0.96 6 sorti2(c1) # label(ax4) # label(axiom). [clausify(4)].
% 0.41/0.96 7 sorti2(c2) # label(ax4) # label(axiom). [clausify(4)].
% 0.41/0.96 8 op2(c1,op2(c1,c2)) != c2 # label(ax4) # label(axiom) # answer(ax4). [clausify(4)].
% 0.41/0.96 10 -sorti2(A) | sorti1(j(A)) # label(co1) # label(negated_conjecture). [clausify(5)].
% 0.41/0.96 11 -sorti2(A) | h(j(A)) = A # label(co1) # label(negated_conjecture). [clausify(5)].
% 0.41/0.96 13 -sorti1(A) | -sorti1(B) | sorti1(op1(A,B)) # label(ax1) # label(axiom). [clausify(1)].
% 0.41/0.96 15 -sorti1(A) | -sorti1(B) | op1(A,op1(A,B)) = B # label(ax3) # label(axiom). [clausify(3)].
% 0.41/0.96 16 -sorti1(A) | -sorti1(B) | h(op1(A,B)) = op2(h(A),h(B)) # label(co1) # label(negated_conjecture). [clausify(5)].
% 0.41/0.96 17 -sorti1(A) | -sorti1(B) | op2(h(A),h(B)) = h(op1(A,B)). [copy(16),flip(c)].
% 0.41/0.96 18 -sorti2(A) | -sorti2(B) | j(op2(A,B)) = op1(j(A),j(B)) # label(co1) # label(negated_conjecture). [clausify(5)].
% 0.41/0.96 19 -sorti2(A) | -sorti2(B) | op1(j(A),j(B)) = j(op2(A,B)). [copy(18),flip(c)].
% 0.41/0.96 20 sorti1(j(c2)). [hyper(10,a,7,a)].
% 0.41/0.96 21 sorti1(j(c1)). [hyper(10,a,6,a)].
% 0.41/0.96 22 h(j(c2)) = c2. [hyper(11,a,7,a)].
% 0.41/0.96 23 h(j(c1)) = c1. [hyper(11,a,6,a)].
% 0.41/0.96 30 op1(j(c1),j(c2)) = j(op2(c1,c2)). [hyper(19,a,6,a,b,7,a)].
% 0.41/0.96 37 h(j(op2(c1,c2))) = op2(c1,c2). [hyper(17,a,21,a,b,20,a),rewrite([23(3),22(4),30(8)]),flip(a)].
% 0.41/0.96 40 op1(j(c1),j(op2(c1,c2))) = j(c2). [hyper(15,a,21,a,b,20,a),rewrite([30(7)])].
% 0.41/0.96 43 sorti1(j(op2(c1,c2))). [hyper(13,a,21,a,b,20,a),rewrite([30(5)])].
% 0.41/0.96 169 op2(c1,op2(c1,c2)) = c2. [hyper(17,a,21,a,b,43,a),rewrite([23(3),37(6),40(12),22(8)])].
% 0.41/0.96 170 $F # answer(ax4). [resolve(169,a,8,a)].
% 0.41/0.96
% 0.41/0.96 % SZS output end Refutation
% 0.41/0.96 ============================== end of proof ==========================
% 0.41/0.96
% 0.41/0.96 ============================== STATISTICS ============================
% 0.41/0.96
% 0.41/0.96 Given=25. Generated=218. Kept=162. proofs=1.
% 0.41/0.96 Usable=25. Sos=126. Demods=86. Limbo=4, Disabled=18. Hints=0.
% 0.41/0.96 Megabytes=0.18.
% 0.41/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of statistics =====================
% 0.41/0.96
% 0.41/0.96 ============================== end of search =========================
% 0.41/0.96
% 0.41/0.96 THEOREM PROVED
% 0.41/0.96 % SZS status Theorem
% 0.41/0.96
% 0.41/0.96 Exiting with 1 proof.
% 0.41/0.96
% 0.41/0.96 Process 20831 exit (max_proofs) Wed Jun 8 14:27:35 2022
% 0.41/0.96 Prover9 interrupted
%------------------------------------------------------------------------------