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