TSTP Solution File: KLE135+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE135+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:23 EDT 2022
% Result : Timeout 300.04s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE135+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 08:56:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 12696 was started by sandbox2 on n004.cluster.edu,
% 0.42/0.99 Thu Jun 16 08:56:39 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12543_n004.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_12543_n004.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (29 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 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.42/0.99 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 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.42/0.99 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 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.42/0.99 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.42/0.99 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 13 (all X0 multiplication(antidomain(X0),X0) = zero) # label(domain1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 14 (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.02/2.30 15 (all X0 addition(antidomain(antidomain(X0)),antidomain(X0)) = one) # label(domain3) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 16 (all X0 domain(X0) = antidomain(antidomain(X0))) # label(domain4) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 17 (all X0 multiplication(X0,coantidomain(X0)) = zero) # label(codomain1) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 18 (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.02/2.30 19 (all X0 addition(coantidomain(coantidomain(X0)),coantidomain(X0)) = one) # label(codomain3) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 20 (all X0 codomain(X0) = coantidomain(coantidomain(X0))) # label(codomain4) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 21 (all X0 c(X0) = antidomain(domain(X0))) # label(complement) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 22 (all X0 all X1 domain_difference(X0,X1) = multiplication(domain(X0),antidomain(X1))) # label(domain_difference) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 23 (all X0 all X1 forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1)))) # label(forward_diamond) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 24 (all X0 all X1 backward_diamond(X0,X1) = codomain(multiplication(codomain(X1),X0))) # label(backward_diamond) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 25 (all X0 all X1 forward_box(X0,X1) = c(forward_diamond(X0,c(X1)))) # label(forward_box) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 26 (all X0 all X1 backward_box(X0,X1) = c(backward_diamond(X0,c(X1)))) # label(backward_box) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 27 (all X0 forward_diamond(X0,divergence(X0)) = divergence(X0)) # label(divergence1) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 28 (all X0 all X1 all X2 (addition(domain(X0),addition(forward_diamond(X1,domain(X0)),domain(X2))) = addition(forward_diamond(X1,domain(X0)),domain(X2)) -> addition(domain(X0),addition(divergence(X1),forward_diamond(star(X1),domain(X2)))) = addition(divergence(X1),forward_diamond(star(X1),domain(X2))))) # label(divergence2) # label(axiom) # label(non_clause). [assumption].
% 2.02/2.30 29 -(all X0 (divergence(X0) = zero -> forward_diamond(star(X0),antidomain(X0)) = one)) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.02/2.30
% 2.02/2.30 ============================== end of process non-clausal formulas ===
% 2.02/2.30
% 2.02/2.30 ============================== PROCESS INITIAL CLAUSES ===============
% 2.02/2.30
% 2.02/2.30 ============================== PREDICATE ELIMINATION =================
% 2.02/2.30 30 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 2.02/2.30 31 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 2.02/2.30
% 2.02/2.30 ============================== end predicate elimination =============
% 2.02/2.30
% 2.02/2.30 Auto_denials:
% 2.02/2.30 % copying label goals to answer in negative clause
% 2.02/2.30
% 2.02/2.30 Term ordering decisions:
% 2.02/2.30 Function symbol KB weights: zero=1. one=1. c1=1. multiplication=1. addition=1. forward_diamond=1. backward_diamond=1. backward_box=1. domain_difference=1. forward_box=1. antidomain=1. coantidomain=1. domain=1. c=1. divergence=1. codomain=1. star=1.
% 2.02/2.30
% 2.02/2.30 ============================== end of process initial clauses ========
% 2.02/2.30
% 2.02/2.30 ============================== CLAUSES FOR SEARCH ====================
% 2.02/2.30
% 2.02/2.30 ============================== end of clauses for search =============
% 2.02/2.30
% 2.02/2.30 ============================== SEARCH ================================
% 2.02/2.30
% 2.02/2.30 % Starting search at 0.01 seconds.
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=86.000, iters=3341
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=78.000, iters=3351
% 2.02/2.30
% 2.02/2.30 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 30 (0.00 of 1.20 sec).
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=42.000, iters=3383
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=40.000, iters=3419
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=37.000, iters=3400
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=36.000, iters=3412
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=35.000, iters=3386
% 2.02/2.30
% 2.02/2.30 Low Water (keep): wt=32.000Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------