TSTP Solution File: KLE049+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE049+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:21:59 EDT 2022
% Result : Timeout 300.04s 300.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : KLE049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.27 % Computer : n006.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Thu Jun 16 07:12:11 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.52/0.86 ============================== Prover9 ===============================
% 0.52/0.86 Prover9 (32) version 2009-11A, November 2009.
% 0.52/0.86 Process 17799 was started by sandbox on n006.cluster.edu,
% 0.52/0.86 Thu Jun 16 07:12:11 2022
% 0.52/0.86 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17619_n006.cluster.edu".
% 0.52/0.86 ============================== end of head ===========================
% 0.52/0.86
% 0.52/0.86 ============================== INPUT =================================
% 0.52/0.86
% 0.52/0.86 % Reading from file /tmp/Prover9_17619_n006.cluster.edu
% 0.52/0.86
% 0.52/0.86 set(prolog_style_variables).
% 0.52/0.86 set(auto2).
% 0.52/0.86 % set(auto2) -> set(auto).
% 0.52/0.86 % set(auto) -> set(auto_inference).
% 0.52/0.86 % set(auto) -> set(auto_setup).
% 0.52/0.86 % set(auto_setup) -> set(predicate_elim).
% 0.52/0.86 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.52/0.86 % set(auto) -> set(auto_limits).
% 0.52/0.86 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.52/0.86 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.52/0.86 % set(auto) -> set(auto_denials).
% 0.52/0.86 % set(auto) -> set(auto_process).
% 0.52/0.86 % set(auto2) -> assign(new_constants, 1).
% 0.52/0.86 % set(auto2) -> assign(fold_denial_max, 3).
% 0.52/0.86 % set(auto2) -> assign(max_weight, "200.000").
% 0.52/0.86 % set(auto2) -> assign(max_hours, 1).
% 0.52/0.86 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.52/0.86 % set(auto2) -> assign(max_seconds, 0).
% 0.52/0.86 % set(auto2) -> assign(max_minutes, 5).
% 0.52/0.86 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.52/0.86 % set(auto2) -> set(sort_initial_sos).
% 0.52/0.86 % set(auto2) -> assign(sos_limit, -1).
% 0.52/0.86 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.52/0.86 % set(auto2) -> assign(max_megs, 400).
% 0.52/0.86 % set(auto2) -> assign(stats, some).
% 0.52/0.86 % set(auto2) -> clear(echo_input).
% 0.52/0.86 % set(auto2) -> set(quiet).
% 0.52/0.86 % set(auto2) -> clear(print_initial_clauses).
% 0.52/0.86 % set(auto2) -> clear(print_given).
% 0.52/0.86 assign(lrs_ticks,-1).
% 0.52/0.86 assign(sos_limit,10000).
% 0.52/0.86 assign(order,kbo).
% 0.52/0.86 set(lex_order_vars).
% 0.52/0.86 clear(print_given).
% 0.52/0.86
% 0.52/0.86 % formulas(sos). % not echoed (21 formulas)
% 0.52/0.86
% 0.52/0.86 ============================== end of input ==========================
% 0.52/0.86
% 0.52/0.86 % From the command line: assign(max_seconds, 300).
% 0.52/0.86
% 0.52/0.86 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.52/0.86
% 0.52/0.86 % Formulas that are not ordinary clauses:
% 0.52/0.86 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 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.52/0.86 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 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.52/0.86 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 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.52/0.86 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.52/0.86 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 13 (all A leq(addition(one,multiplication(A,star(A))),star(A))) # label(star_unfold_right) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 14 (all A leq(addition(one,multiplication(star(A),A)),star(A))) # label(star_unfold_left) # label(axiom) # label(non_clause). [assumption].
% 0.52/0.86 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].
% 1.81/2.16 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].
% 1.81/2.16 17 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 1.81/2.16 18 (all X0 all X1 (complement(X1,X0) <-> multiplication(X0,X1) = zero & multiplication(X1,X0) = zero & addition(X0,X1) = one)) # label(test_2) # label(axiom) # label(non_clause). [assumption].
% 1.81/2.16 19 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 1.81/2.16 20 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 1.81/2.16 21 -(all X0 all X1 all X2 (test(X1) & test(X2) & leq(multiplication(multiplication(multiplication(X2,X1),X0),c(X2)),zero) -> leq(multiplication(multiplication(multiplication(X2,star(multiplication(X1,X0))),c(X1)),c(X2)),zero))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.81/2.16
% 1.81/2.16 ============================== end of process non-clausal formulas ===
% 1.81/2.16
% 1.81/2.16 ============================== PROCESS INITIAL CLAUSES ===============
% 1.81/2.16
% 1.81/2.16 ============================== PREDICATE ELIMINATION =================
% 1.81/2.16 22 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(17)].
% 1.81/2.16 23 test(c2) # label(goals) # label(negated_conjecture). [clausify(21)].
% 1.81/2.16 24 test(c3) # label(goals) # label(negated_conjecture). [clausify(21)].
% 1.81/2.16 25 test(A) | c(A) = zero # label(test_4) # label(axiom). [clausify(20)].
% 1.81/2.16 26 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(17)].
% 1.81/2.16 Derived: complement(f1(c2),c2). [resolve(22,a,23,a)].
% 1.81/2.16 Derived: complement(f1(c3),c3). [resolve(22,a,24,a)].
% 1.81/2.16 Derived: complement(f1(A),A) | c(A) = zero. [resolve(22,a,25,a)].
% 1.81/2.16 Derived: complement(f1(A),A) | -complement(B,A). [resolve(22,a,26,a)].
% 1.81/2.16 27 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(19)].
% 1.81/2.16 Derived: c(c2) != A | complement(c2,A). [resolve(27,a,23,a)].
% 1.81/2.16 Derived: c(c3) != A | complement(c3,A). [resolve(27,a,24,a)].
% 1.81/2.16 Derived: c(A) != B | complement(A,B) | c(A) = zero. [resolve(27,a,25,a)].
% 1.81/2.16 Derived: c(A) != B | complement(A,B) | -complement(C,A). [resolve(27,a,26,a)].
% 1.81/2.16 28 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(19)].
% 1.81/2.16 Derived: c(c2) = A | -complement(c2,A). [resolve(28,a,23,a)].
% 1.81/2.16 Derived: c(c3) = A | -complement(c3,A). [resolve(28,a,24,a)].
% 1.81/2.16 Derived: c(A) = B | -complement(A,B) | c(A) = zero. [resolve(28,a,25,a)].
% 1.81/2.16 Derived: c(A) = B | -complement(A,B) | -complement(C,A). [resolve(28,a,26,a)].
% 1.81/2.16
% 1.81/2.16 ============================== end predicate elimination =============
% 1.81/2.16
% 1.81/2.16 Auto_denials: (non-Horn, no changes).
% 1.81/2.16
% 1.81/2.16 Term ordering decisions:
% 1.81/2.16 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. multiplication=1. addition=1. c=1. star=1. f1=1.
% 1.81/2.16
% 1.81/2.16 ============================== end of process initial clauses ========
% 1.81/2.16
% 1.81/2.16 ============================== CLAUSES FOR SEARCH ====================
% 1.81/2.16
% 1.81/2.16 ============================== end of clauses for search =============
% 1.81/2.16
% 1.81/2.16 ============================== SEARCH ================================
% 1.81/2.16
% 1.81/2.16 % Starting search at 0.02 seconds.
% 1.81/2.16
% 1.81/2.16 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 58 (0.00 of 0.77 sec).
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=81.000, iters=3424
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=79.000, iters=3423
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=54.000, iters=3373
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=45.000, iters=3396
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=40.000, iters=3486
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=37.000, iters=3366
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=35.000, iters=3360
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=34.000, iters=3383
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=33.000, iters=3493
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=32.000, iters=3376
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=31.000, iters=3355
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=30.000, iters=3359
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=29.000, iters=3406
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=28.000, iters=3383
% 1.81/2.16
% 1.81/2.16 Low Water (keep): wt=27.000, iters=3349
% 1.81/2.16
% 1.81/2.16 LoCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------