TSTP Solution File: KLE050+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE050+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:00 EDT 2022
% Result : Timeout 300.02s 300.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE050+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 16 14:41:59 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.79/1.06 ============================== Prover9 ===============================
% 0.79/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.06 Process 16585 was started by sandbox2 on n013.cluster.edu,
% 0.79/1.06 Thu Jun 16 14:41:59 2022
% 0.79/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16432_n013.cluster.edu".
% 0.79/1.06 ============================== end of head ===========================
% 0.79/1.06
% 0.79/1.06 ============================== INPUT =================================
% 0.79/1.06
% 0.79/1.06 % Reading from file /tmp/Prover9_16432_n013.cluster.edu
% 0.79/1.06
% 0.79/1.06 set(prolog_style_variables).
% 0.79/1.06 set(auto2).
% 0.79/1.06 % set(auto2) -> set(auto).
% 0.79/1.06 % set(auto) -> set(auto_inference).
% 0.79/1.06 % set(auto) -> set(auto_setup).
% 0.79/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.06 % set(auto) -> set(auto_limits).
% 0.79/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.06 % set(auto) -> set(auto_denials).
% 0.79/1.06 % set(auto) -> set(auto_process).
% 0.79/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.06 % set(auto2) -> assign(stats, some).
% 0.79/1.06 % set(auto2) -> clear(echo_input).
% 0.79/1.06 % set(auto2) -> set(quiet).
% 0.79/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.06 % set(auto2) -> clear(print_given).
% 0.79/1.06 assign(lrs_ticks,-1).
% 0.79/1.06 assign(sos_limit,10000).
% 0.79/1.06 assign(order,kbo).
% 0.79/1.06 set(lex_order_vars).
% 0.79/1.06 clear(print_given).
% 0.79/1.06
% 0.79/1.06 % formulas(sos). % not echoed (23 formulas)
% 0.79/1.06
% 0.79/1.06 ============================== end of input ==========================
% 0.79/1.06
% 0.79/1.06 % From the command line: assign(max_seconds, 300).
% 0.79/1.06
% 0.79/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.06
% 0.79/1.06 % Formulas that are not ordinary clauses:
% 0.79/1.06 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.79/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.79/1.06 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.06 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.79/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.79/1.06 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.06 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.79/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.79/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.79/1.06 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.06 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.06 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.79/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.79/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.79/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].
% 0.79/1.07 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].
% 0.79/1.07 17 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.07 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].
% 0.79/1.07 19 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.07 20 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.79/1.07 21 (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].
% 0.79/1.07 22 (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].
% 0.79/1.07 23 -(all X0 all X1 all X2 all X3 (test(X2) & test(X3) -> multiplication(star(multiplication(multiplication(multiplication(X2,X0),star(multiplication(X3,X1))),c(X3))),c(X2)) = addition(multiplication(multiplication(multiplication(multiplication(X2,X0),addition(X2,X3)),star(addition(multiplication(X3,X1),multiplication(c(X3),X0)))),c(addition(X2,X3))),c(X2)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.79/1.07
% 0.79/1.07 ============================== end of process non-clausal formulas ===
% 0.79/1.07
% 0.79/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.07
% 0.79/1.07 ============================== PREDICATE ELIMINATION =================
% 0.79/1.07 24 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(17)].
% 0.79/1.07 25 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(17)].
% 0.79/1.07 26 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom). [clausify(18)].
% 0.79/1.07 Derived: multiplication(A,f1(A)) = zero | -test(A). [resolve(26,a,24,b)].
% 0.79/1.07 27 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(18)].
% 0.79/1.07 Derived: multiplication(f1(A),A) = zero | -test(A). [resolve(27,a,24,b)].
% 0.79/1.07 28 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(18)].
% 0.79/1.07 Derived: addition(A,f1(A)) = one | -test(A). [resolve(28,a,24,b)].
% 0.79/1.07 29 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(19)].
% 0.79/1.07 Derived: -test(A) | c(A) != B | test(B). [resolve(29,c,25,b)].
% 0.79/1.07 Derived: -test(A) | c(A) != B | multiplication(B,A) = zero. [resolve(29,c,26,a)].
% 0.79/1.07 Derived: -test(A) | c(A) != B | multiplication(A,B) = zero. [resolve(29,c,27,a)].
% 0.79/1.07 Derived: -test(A) | c(A) != B | addition(B,A) = one. [resolve(29,c,28,a)].
% 0.79/1.07 30 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(19)].
% 0.79/1.07 Derived: -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(30,c,24,b)].
% 0.79/1.07 31 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(18)].
% 0.79/1.07 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(31,a,25,b)].
% 0.79/1.07 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | -test(B) | c(B) = A. [resolve(31,a,30,c)].
% 0.79/1.07
% 0.79/1.07 ============================== end predicate elimination =============
% 0.79/1.07
% 0.79/1.07 Auto_denials: (non-Horn, no changes).
% 0.79/1.07
% 0.79/1.07 Term ordering decisions:
% 0.79/1.07 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. c3=1. c4=1. multiplication=1. addition=1. c=1. star=1. f1=1.
% 0.79/1.07
% 0.79/1.07 ============================== end of process initial clauses ========
% 0.79/1.07
% 0.79/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.07
% 0.79/1.07 ============================== end of clauses for search =============
% 0.79/1.07
% 0.79/1.07 ============================== SEARCH ================================
% 0.79/1.07
% 0.79/1.07 % StCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------