TSTP Solution File: KLE032+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE032+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:52 EDT 2022
% Result : Timeout 300.07s 300.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE032+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 09:11:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 15018 was started by sandbox on n022.cluster.edu,
% 0.42/0.99 Thu Jun 16 09:11:18 2022
% 0.42/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14865_n022.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_14865_n022.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 (19 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 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 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].
% 0.42/0.99 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 17 (all X0 all X1 all X2 (ismeet(X2,X0,X1) <-> leq(X2,X0) & leq(X2,X1) & (all X3 (leq(X3,X0) & leq(X3,X1) -> leq(X3,X2))))) # label(ismeet) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 18 (all X0 all X1 all X2 (ismeetu(X2,X0,X1) <-> (all X3 (leq(X3,X0) & leq(X3,X1) <-> leq(X3,X2))))) # label(ismeetu) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 19 -(all X0 all X1 all X2 (test(X2) & test(X1) -> ismeet(multiplication(multiplication(X1,X2),X0),multiplication(X1,X0),multiplication(X2,X0)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.42/0.99 21 test(c3) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.42/0.99 22 test(c2) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.42/0.99 23 test(A) | c(A) = zero # label(test_4) # label(axiom). [clausify(16)].
% 0.42/0.99 24 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.42/0.99 Derived: complement(f1(c3),c3). [resolve(20,a,21,a)].
% 0.42/0.99 Derived: complement(f1(c2),c2). [resolve(20,a,22,a)].
% 0.42/0.99 Derived: complement(f1(A),A) | c(A) = zero. [resolve(20,a,23,a)].
% 0.42/0.99 Derived: complement(f1(A),A) | -complement(B,A). [resolve(20,a,24,a)].
% 0.42/0.99 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.42/0.99 Derived: c(c3) != A | complement(c3,A). [resolve(25,a,21,a)].
% 0.42/0.99 Derived: c(c2) != A | complement(c2,A). [resolve(25,a,22,a)].
% 0.42/0.99 Derived: c(A) != B | complement(A,B) | c(A) = zero. [resolve(25,a,23,a)].
% 0.42/0.99 Derived: c(A) != B | complement(A,B) | -complement(C,A). [resolve(25,a,24,a)].
% 0.42/0.99 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.42/0.99 Derived: c(c3) = A | -complement(c3,A). [resolve(26,a,21,a)].
% 0.42/0.99 Derived: c(c2) = A | -complement(c2,A). [resolve(26,a,22,a)].
% 0.42/0.99 Derived: c(A) = B | -complement(A,B) | c(A) = zero. [resolve(26,a,23,a)].
% 0.42/0.99 Derived: c(A) = B | -complement(A,B) | -complement(C,A). [resolve(26,a,24,a)].
% 0.42/0.99 27 -ismeetu(A,B,C) | leq(D,B) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 28 ismeetu(A,B,C) | leq(f3(B,C,A),B) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 29 ismeetu(A,B,C) | leq(f3(B,C,A),C) | leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 Derived: leq(A,B) | -leq(A,C) | leq(f3(B,D,C),B) | leq(f3(B,D,C),C). [resolve(27,a,28,a)].
% 0.42/0.99 Derived: leq(A,B) | -leq(A,C) | leq(f3(B,D,C),D) | leq(f3(B,D,C),C). [resolve(27,a,29,a)].
% 0.42/0.99 30 -ismeetu(A,B,C) | leq(D,C) | -leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 Derived: leq(A,B) | -leq(A,C) | leq(f3(D,B,C),D) | leq(f3(D,B,C),C). [resolve(30,a,28,a)].
% 0.42/0.99 Derived: leq(A,B) | -leq(A,C) | leq(f3(D,B,C),B) | leq(f3(D,B,C),C). [resolve(30,a,29,a)].
% 0.42/0.99 31 -ismeetu(A,B,C) | -leq(D,B) | -leq(D,C) | leq(D,A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 Derived: -leq(A,B) | -leq(A,C) | leq(A,D) | leq(f3(B,C,D),B) | leq(f3(B,C,D),D). [resolve(31,a,28,a)].
% 0.42/0.99 Derived: -leq(A,B) | -leq(A,C) | leq(A,D) | leq(f3(B,C,D),C) | leq(f3(B,C,D),D). [resolve(31,a,29,a)].
% 0.42/0.99 32 ismeetu(A,B,C) | -leq(f3(B,C,A),B) | -leq(f3(B,C,A),C) | -leq(f3(B,C,A),A) # label(ismeetu) # label(axiom). [clausify(18)].
% 0.42/0.99 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | leq(D,A) | -leq(D,C). [resolve(32,a,27,a)].
% 0.42/0.99 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | leq(D,B) | -leq(D,C). [resolve(32,a,30,a)].
% 0.42/0.99 Derived: -leq(f3(A,B,C),A) | -leq(f3(A,B,C),B) | -leq(f3(A,B,C),C) | -leq(D,A) | -leq(D,B) | leq(D,C). [resolve(32,a,31,a)].
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials: (nonCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------