TSTP Solution File: KLE094+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE094+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 : Sun Jul 17 02:22:12 EDT 2022
% Result : Timeout 300.02s 300.40s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE094+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n027.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 15:44:50 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 9836 was started by sandbox on n027.cluster.edu,
% 0.49/1.06 Thu Jun 16 15:44:51 2022
% 0.49/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9682_n027.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_9682_n027.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 (31 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 A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 2 (all C all B all A addition(A,addition(B,C)) = addition(addition(A,B),C)) # label(additive_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 5 (all A all B all C multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C)) # label(multiplicative_associativity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 8 (all A all B all C multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C))) # label(right_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 9 (all A all B all C multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C))) # label(left_distributivity) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 13 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 15 (all A all B all C (leq(addition(multiplication(A,B),C),B) -> leq(multiplication(star(A),C),B))) # label(star_induction_left) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 16 (all A all B all C (leq(addition(multiplication(A,B),C),A) -> leq(multiplication(C,star(B)),A))) # label(star_induction_right) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 17 (all X0 multiplication(antidomain(X0),X0) = zero) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 18 (all X0 all X1 addition(antidomain(multiplication(X0,X1)),antidomain(multiplication(X0,antidomain(antidomain(X1))))) = antidomain(multiplication(X0,antidomain(antidomain(X1))))) # label(domain2) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 19 (all X0 addition(antidomain(antidomain(X0)),antidomain(X0)) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 20 (all X0 domain(X0) = antidomain(antidomain(X0))) # label(domain4) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 21 (all X0 multiplication(X0,coantidomain(X0)) = zero) # label(codomain1) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 22 (all X0 all X1 addition(coantidomain(multiplication(X0,X1)),coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) = coantidomain(multiplication(coantidomain(coantidomain(X0)),X1))) # label(codomain2) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 23 (all X0 addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one) # label(codomain3) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 24 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 25 (all X0 c(X0) = antidomain(domain(X0))) # label(complement) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 26 (all X0 all X1 domain_difference(X0,X1) = multiplication(domain(X0),antidomain(X1))) # label(domain_difference) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 27 (all X0 all X1 forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1)))) # label(forward_diamond) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 28 (all X0 all X1 backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0))) # label(backward_diamond) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 29 (all X0 all X1 forward_box(X0,X1) = c(forward_diamond(X0,c(X1)))) # label(forward_box) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 30 (all X0 all X1 backward_box(X0,X1) = c(backward_diamond(X0,c(X1)))) # label(backward_box) # label(axiom) # label(non_clause). [assumption].
% 2.22/2.55 31 -(all X0 all X1 addition(domain_difference(forward_diamond(star(X0),domain(X1)),domain(X1)),forward_diamond(star(X0),domain_difference(forward_diamond(X0,domain(X1)),domain(X1)))) = forward_diamond(star(X0),domain_difference(forward_diamond(X0,domain(X1)),domain(X1)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.22/2.55
% 2.22/2.55 ============================== end of process non-clausal formulas ===
% 2.22/2.55
% 2.22/2.55 ============================== PROCESS INITIAL CLAUSES ===============
% 2.22/2.55
% 2.22/2.55 ============================== PREDICATE ELIMINATION =================
% 2.22/2.55
% 2.22/2.55 ============================== end predicate elimination =============
% 2.22/2.55
% 2.22/2.55 Auto_denials:
% 2.22/2.55 % copying label goals to answer in negative clause
% 2.22/2.55
% 2.22/2.55 Term ordering decisions:
% 2.22/2.55 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. multiplication=1. addition=1. backward_diamond=1. forward_diamond=1. backward_box=1. domain_difference=1. forward_box=1. antidomain=1. coantidomain=1. star=1. c=1. domain=1. codomain=1.
% 2.22/2.55
% 2.22/2.55 ============================== end of process initial clauses ========
% 2.22/2.55
% 2.22/2.55 ============================== CLAUSES FOR SEARCH ====================
% 2.22/2.55
% 2.22/2.55 ============================== end of clauses for search =============
% 2.22/2.55
% 2.22/2.55 ============================== SEARCH ================================
% 2.22/2.55
% 2.22/2.55 % Starting search at 0.02 seconds.
% 2.22/2.55
% 2.22/2.55 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 21 (0.00 of 0.75 sec).
% 2.22/2.55
% 2.22/2.55 Low Water (keep): wt=27.000, iters=3886
% 2.22/2.55
% 2.22/2.55 Low Water (keep): wt=24.000, iters=3504
% 2.22/2.55
% 2.22/2.55 Low Water (keep): wt=23.000, iters=3441
% 2.22/2.55
% 2.22/2.55 Low Water (keep): wt=22.000, iters=3352
% 2.22/2.55
% 2.22/2.55 Low WateCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------