TSTP Solution File: KLE028+4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE028+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:51 EDT 2022
% Result : Timeout 300.03s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KLE028+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 16 10:30:29 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.50/0.81 ============================== Prover9 ===============================
% 0.50/0.81 Prover9 (32) version 2009-11A, November 2009.
% 0.50/0.81 Process 11383 was started by sandbox2 on n032.cluster.edu,
% 0.50/0.81 Thu Jun 16 10:30:30 2022
% 0.50/0.81 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11229_n032.cluster.edu".
% 0.50/0.81 ============================== end of head ===========================
% 0.50/0.81
% 0.50/0.81 ============================== INPUT =================================
% 0.50/0.81
% 0.50/0.81 % Reading from file /tmp/Prover9_11229_n032.cluster.edu
% 0.50/0.81
% 0.50/0.81 set(prolog_style_variables).
% 0.50/0.81 set(auto2).
% 0.50/0.81 % set(auto2) -> set(auto).
% 0.50/0.81 % set(auto) -> set(auto_inference).
% 0.50/0.81 % set(auto) -> set(auto_setup).
% 0.50/0.81 % set(auto_setup) -> set(predicate_elim).
% 0.50/0.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/0.81 % set(auto) -> set(auto_limits).
% 0.50/0.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/0.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/0.81 % set(auto) -> set(auto_denials).
% 0.50/0.81 % set(auto) -> set(auto_process).
% 0.50/0.81 % set(auto2) -> assign(new_constants, 1).
% 0.50/0.81 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/0.81 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/0.81 % set(auto2) -> assign(max_hours, 1).
% 0.50/0.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/0.81 % set(auto2) -> assign(max_seconds, 0).
% 0.50/0.81 % set(auto2) -> assign(max_minutes, 5).
% 0.50/0.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/0.81 % set(auto2) -> set(sort_initial_sos).
% 0.50/0.81 % set(auto2) -> assign(sos_limit, -1).
% 0.50/0.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/0.81 % set(auto2) -> assign(max_megs, 400).
% 0.50/0.81 % set(auto2) -> assign(stats, some).
% 0.50/0.81 % set(auto2) -> clear(echo_input).
% 0.50/0.81 % set(auto2) -> set(quiet).
% 0.50/0.81 % set(auto2) -> clear(print_initial_clauses).
% 0.50/0.81 % set(auto2) -> clear(print_given).
% 0.50/0.81 assign(lrs_ticks,-1).
% 0.50/0.81 assign(sos_limit,10000).
% 0.50/0.81 assign(order,kbo).
% 0.50/0.81 set(lex_order_vars).
% 0.50/0.81 clear(print_given).
% 0.50/0.81
% 0.50/0.81 % formulas(sos). % not echoed (19 formulas)
% 0.50/0.81
% 0.50/0.81 ============================== end of input ==========================
% 0.50/0.81
% 0.50/0.81 % From the command line: assign(max_seconds, 300).
% 0.50/0.81
% 0.50/0.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/0.81
% 0.50/0.81 % Formulas that are not ordinary clauses:
% 0.50/0.81 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 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.50/0.81 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 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.50/0.81 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 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.50/0.81 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.50/0.81 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.81 14 (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.48/1.75 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 1.48/1.75 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 1.48/1.75 17 (all X0 all X1 (test(X0) & test(X1) -> c(addition(X0,X1)) = multiplication(c(X0),c(X1)))) # label(test_deMorgan1) # label(axiom) # label(non_clause). [assumption].
% 1.48/1.75 18 (all X0 all X1 (test(X0) & test(X1) -> c(multiplication(X0,X1)) = addition(c(X0),c(X1)))) # label(test_deMorgan2) # label(axiom) # label(non_clause). [assumption].
% 1.48/1.75 19 -(all X0 all X1 all X2 all X3 all X4 all X5 (test(X4) & test(X5) -> leq(addition(multiplication(X4,addition(multiplication(X5,X0),multiplication(c(X5),X1))),multiplication(c(X4),addition(multiplication(X5,X2),multiplication(c(X5),X3)))),addition(multiplication(X5,addition(multiplication(X4,X0),multiplication(c(X4),X2))),multiplication(c(X5),addition(multiplication(X4,X1),multiplication(c(X4),X3))))) & leq(addition(multiplication(X5,addition(multiplication(X4,X0),multiplication(c(X4),X2))),multiplication(c(X5),addition(multiplication(X4,X1),multiplication(c(X4),X3)))),addition(multiplication(X4,addition(multiplication(X5,X0),multiplication(c(X5),X1))),multiplication(c(X4),addition(multiplication(X5,X2),multiplication(c(X5),X3))))))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.48/1.75
% 1.48/1.75 ============================== end of process non-clausal formulas ===
% 1.48/1.75
% 1.48/1.75 ============================== PROCESS INITIAL CLAUSES ===============
% 1.48/1.75
% 1.48/1.75 ============================== PREDICATE ELIMINATION =================
% 1.48/1.75 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 1.48/1.75 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 1.48/1.75 22 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom). [clausify(14)].
% 1.48/1.75 Derived: multiplication(A,f1(A)) = zero | -test(A). [resolve(22,a,20,b)].
% 1.48/1.75 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 1.48/1.75 Derived: multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 1.48/1.75 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 1.48/1.75 Derived: addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 1.48/1.75 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 1.48/1.75 Derived: -test(A) | c(A) != B | test(B). [resolve(25,c,21,b)].
% 1.48/1.75 Derived: -test(A) | c(A) != B | multiplication(B,A) = zero. [resolve(25,c,22,a)].
% 1.48/1.75 Derived: -test(A) | c(A) != B | multiplication(A,B) = zero. [resolve(25,c,23,a)].
% 1.48/1.75 Derived: -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 1.48/1.75 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 1.48/1.75 Derived: -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 1.48/1.75 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 1.48/1.75 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 1.48/1.75 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | -test(B) | c(B) = A. [resolve(27,a,26,c)].
% 1.48/1.75
% 1.48/1.75 ============================== end predicate elimination =============
% 1.48/1.75
% 1.48/1.75 Auto_denials: (non-Horn, no changes).
% 1.48/1.75
% 1.48/1.75 Term ordering decisions:
% 1.48/1.75 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. multiplication=1. addition=1. c=1. f1=1.
% 1.48/1.75
% 1.48/1.75 ============================== end of process initial clauses ========
% 1.48/1.75
% 1.48/1.75 ============================== CLAUSES FOR SEARCH ====================
% 1.48/1.75
% 1.48/1.75 ============================== end of clauses for search =============
% 1.48/1.75
% 1.48/1.75 ============================== SEARCH ================================
% 1.48/1.75
% 1.48/1.75 % Starting search at 0.01 seconds.
% 1.48/1.75
% 1.48/1.75 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 55 (0.00 of 0.85 sec).
% 1.48/1.75
% 1.48/1.75 Low Water (keep): wt=68.000, iters=3370
% 1.48/1.75
% 1.48/1.75 Low Water (keep): wt=65.000, iters=3430
% 1.48/1.75
% 1.48/1.75 Low Water (keep): wt=61.000, iters=3411
% 1.48/1.75
% 1.48/1.75 Low Water Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------