TSTP Solution File: KLE021+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KLE021+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:46 EDT 2022
% Result : Theorem 0.83s 1.09s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE021+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 10:37:19 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.48/1.04 ============================== Prover9 ===============================
% 0.48/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.04 Process 20350 was started by sandbox on n016.cluster.edu,
% 0.48/1.04 Thu Jun 16 10:37:19 2022
% 0.48/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20197_n016.cluster.edu".
% 0.48/1.04 ============================== end of head ===========================
% 0.48/1.04
% 0.48/1.04 ============================== INPUT =================================
% 0.48/1.04
% 0.48/1.04 % Reading from file /tmp/Prover9_20197_n016.cluster.edu
% 0.48/1.04
% 0.48/1.04 set(prolog_style_variables).
% 0.48/1.04 set(auto2).
% 0.48/1.04 % set(auto2) -> set(auto).
% 0.48/1.04 % set(auto) -> set(auto_inference).
% 0.48/1.04 % set(auto) -> set(auto_setup).
% 0.48/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.48/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.04 % set(auto) -> set(auto_limits).
% 0.48/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.04 % set(auto) -> set(auto_denials).
% 0.48/1.04 % set(auto) -> set(auto_process).
% 0.48/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.48/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.48/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.48/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.48/1.04 % set(auto2) -> assign(stats, some).
% 0.48/1.04 % set(auto2) -> clear(echo_input).
% 0.48/1.04 % set(auto2) -> set(quiet).
% 0.48/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.04 % set(auto2) -> clear(print_given).
% 0.48/1.04 assign(lrs_ticks,-1).
% 0.48/1.04 assign(sos_limit,10000).
% 0.48/1.04 assign(order,kbo).
% 0.48/1.04 set(lex_order_vars).
% 0.48/1.04 clear(print_given).
% 0.48/1.04
% 0.48/1.04 % formulas(sos). % not echoed (19 formulas)
% 0.48/1.04
% 0.48/1.04 ============================== end of input ==========================
% 0.48/1.04
% 0.48/1.04 % From the command line: assign(max_seconds, 300).
% 0.48/1.04
% 0.48/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.04
% 0.48/1.04 % Formulas that are not ordinary clauses:
% 0.48/1.04 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 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.48/1.04 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 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.48/1.04 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 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.48/1.04 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.48/1.04 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 11 (all A multiplication(zero,A) = zero) # label(left_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 12 (all A all B (leq(A,B) <-> addition(A,B) = B)) # label(order) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.04 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.83/1.09 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 16 (all X0 (-test(X0) -> c(X0) = zero)) # label(test_4) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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].
% 0.83/1.09 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].
% 0.83/1.09 19 -(all X0 all X1 (test(X1) -> X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.09
% 0.83/1.09 ============================== end of process non-clausal formulas ===
% 0.83/1.09
% 0.83/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.09
% 0.83/1.09 ============================== PREDICATE ELIMINATION =================
% 0.83/1.09 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.83/1.09 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.83/1.09 22 -complement(A,B) | multiplication(B,A) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: multiplication(A,f1(A)) = zero | -test(A). [resolve(22,a,20,b)].
% 0.83/1.09 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.83/1.09 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.83/1.09 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.83/1.09 Derived: -test(A) | c(A) != B | test(B). [resolve(25,c,21,b)].
% 0.83/1.09 Derived: -test(A) | c(A) != B | multiplication(B,A) = zero. [resolve(25,c,22,a)].
% 0.83/1.09 Derived: -test(A) | c(A) != B | multiplication(A,B) = zero. [resolve(25,c,23,a)].
% 0.83/1.09 Derived: -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.83/1.09 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.83/1.09 Derived: -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.83/1.09 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.83/1.09 Derived: multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | -test(B) | c(B) = A. [resolve(27,a,26,c)].
% 0.83/1.09 28 leq(A,B) | addition(A,B) != B # label(order) # label(axiom). [clausify(12)].
% 0.83/1.09 29 -leq(A,B) | addition(A,B) = B # label(order) # label(axiom). [clausify(12)].
% 0.83/1.09
% 0.83/1.09 ============================== end predicate elimination =============
% 0.83/1.09
% 0.83/1.09 Auto_denials: (non-Horn, no changes).
% 0.83/1.09
% 0.83/1.09 Term ordering decisions:
% 0.83/1.09 Function symbol KB weights: zero=1. one=1. c1=1. c2=1. multiplication=1. addition=1. c=1. f1=1.
% 0.83/1.09
% 0.83/1.09 ============================== end of process initial clauses ========
% 0.83/1.09
% 0.83/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.09
% 0.83/1.09 ============================== end of clauses for search =============
% 0.83/1.09
% 0.83/1.09 ============================== SEARCH ================================
% 0.83/1.09
% 0.83/1.09 % Starting search at 0.01 seconds.
% 0.83/1.09
% 0.83/1.09 ============================== PROOF =================================
% 0.83/1.09 % SZS status Theorem
% 0.83/1.09 % SZS output start Refutation
% 0.83/1.09
% 0.83/1.09 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.83/1.09 % Length of proof is 56.
% 0.83/1.09 % Level of proof is 12.
% 0.83/1.09 % Maximum clause weight is 17.000.
% 0.83/1.09 % Given clauses 102.
% 0.83/1.09
% 0.83/1.09 1 (all A all B addition(A,B) = addition(B,A)) # label(additive_commutativity) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 3 (all A addition(A,zero) = A) # label(additive_identity) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 4 (all A addition(A,A) = A) # label(additive_idempotence) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 6 (all A multiplication(A,one) = A) # label(multiplicative_right_identity) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 7 (all A multiplication(one,A) = A) # label(multiplicative_left_identity) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 10 (all A multiplication(A,zero) = zero) # label(right_annihilation) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 13 (all X0 (test(X0) <-> (exists X1 complement(X1,X0)))) # label(test_1) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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.83/1.09 15 (all X0 all X1 (test(X0) -> (c(X0) = X1 <-> complement(X0,X1)))) # label(test_3) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.09 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].
% 0.83/1.09 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].
% 0.83/1.09 19 -(all X0 all X1 (test(X1) -> X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)))) # label(goals) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.09 20 -test(A) | complement(f1(A),A) # label(test_1) # label(axiom). [clausify(13)].
% 0.83/1.09 21 test(A) | -complement(B,A) # label(test_1) # label(axiom). [clausify(13)].
% 0.83/1.09 23 -complement(A,B) | multiplication(A,B) = zero # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 24 -complement(A,B) | addition(B,A) = one # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 25 -test(A) | c(A) != B | complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.83/1.09 26 -test(A) | c(A) = B | -complement(A,B) # label(test_3) # label(axiom). [clausify(15)].
% 0.83/1.09 27 complement(A,B) | multiplication(B,A) != zero | multiplication(A,B) != zero | addition(B,A) != one # label(test_2) # label(axiom). [clausify(14)].
% 0.83/1.09 30 test(c2) # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.83/1.09 31 addition(A,zero) = A # label(additive_identity) # label(axiom). [clausify(3)].
% 0.83/1.09 32 addition(A,A) = A # label(additive_idempotence) # label(axiom). [clausify(4)].
% 0.83/1.09 33 multiplication(A,one) = A # label(multiplicative_right_identity) # label(axiom). [clausify(6)].
% 0.83/1.09 34 multiplication(one,A) = A # label(multiplicative_left_identity) # label(axiom). [clausify(7)].
% 0.83/1.09 35 multiplication(A,zero) = zero # label(right_annihilation) # label(axiom). [clausify(10)].
% 0.83/1.09 38 addition(A,B) = addition(B,A) # label(additive_commutativity) # label(axiom). [clausify(1)].
% 0.83/1.09 44 multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) # label(left_distributivity) # label(axiom). [clausify(9)].
% 0.83/1.09 45 addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B). [copy(44),flip(a)].
% 0.83/1.09 46 addition(multiplication(c2,c1),multiplication(c(c2),c1)) != c1 # label(goals) # label(negated_conjecture). [clausify(19)].
% 0.83/1.09 47 multiplication(addition(c2,c(c2)),c1) != c1. [copy(46),rewrite([45(8)])].
% 0.83/1.09 48 -test(A) | -test(B) | c(addition(A,B)) = multiplication(c(A),c(B)) # label(test_deMorgan1) # label(axiom). [clausify(17)].
% 0.83/1.09 49 -test(A) | -test(B) | multiplication(c(A),c(B)) = c(addition(A,B)). [copy(48),flip(c)].
% 0.83/1.09 50 -test(A) | -test(B) | c(multiplication(A,B)) = addition(c(A),c(B)) # label(test_deMorgan2) # label(axiom). [clausify(18)].
% 0.83/1.09 51 -test(A) | -test(B) | addition(c(A),c(B)) = c(multiplication(A,B)). [copy(50),flip(c)].
% 0.83/1.09 53 multiplication(f1(A),A) = zero | -test(A). [resolve(23,a,20,b)].
% 0.83/1.09 54 addition(A,f1(A)) = one | -test(A). [resolve(24,a,20,b)].
% 0.83/1.09 58 -test(A) | c(A) != B | addition(B,A) = one. [resolve(25,c,24,a)].
% 0.83/1.09 59 -test(A) | c(A) != B | addition(A,B) = one. [copy(58),rewrite([38(4)])].
% 0.83/1.09 60 -test(f1(A)) | c(f1(A)) = A | -test(A). [resolve(26,c,20,b)].
% 0.83/1.09 61 multiplication(A,B) != zero | multiplication(B,A) != zero | addition(A,B) != one | test(A). [resolve(27,a,21,b)].
% 0.83/1.09 63 -test(A) | multiplication(c(A),c(A)) = c(A). [factor(49,a,b),rewrite([32(5)])].
% 0.83/1.09 94 c(c2) != A | addition(A,c2) = one. [resolve(59,a,30,a),rewrite([38(5)])].
% 0.83/1.09 98 test(one). [resolve(61,c,31,a),rewrite([35(3),33(6)]),xx(a),xx(b)].
% 0.83/1.09 109 multiplication(c(c2),c(c2)) = c(c2). [resolve(63,a,30,a)].
% 0.83/1.09 119 addition(one,f1(one)) = one. [resolve(98,a,54,b)].
% 0.83/1.09 120 f1(one) = zero. [resolve(98,a,53,b),rewrite([33(4)])].
% 0.83/1.09 124 addition(zero,one) = one. [back_rewrite(119),rewrite([120(3),38(3)])].
% 0.83/1.09 125 -test(zero) | c(zero) = one. [para(120(a,1),60(a,1)),rewrite([120(4)]),unit_del(c,98)].
% 0.83/1.09 126 test(zero). [resolve(124,a,61,c),rewrite([33(3),35(6)]),xx(a),xx(b)].
% 0.83/1.09 127 c(zero) = one. [back_unit_del(125),unit_del(a,126)].
% 0.83/1.09 130 -test(A) | addition(one,c(A)) = one. [resolve(126,a,51,b),rewrite([127(4),38(4),35(6),127(6)])].
% 0.83/1.09 324 addition(one,c(c2)) = one. [resolve(130,a,30,a)].
% 0.83/1.09 326 addition(A,multiplication(c(c2),A)) = A. [para(324(a,1),45(a,2,1)),rewrite([34(2),34(6)])].
% 0.83/1.09 456 addition(c2,c(c2)) = one. [resolve(94,a,326,a(flip)),rewrite([109(7),32(5),38(4)])].
% 0.83/1.09 459 $F. [back_rewrite(47),rewrite([456(4),34(3)]),xx(a)].
% 0.83/1.09
% 0.83/1.09 % SZS output end Refutation
% 0.83/1.09 ============================== end of proof ==========================
% 0.83/1.09
% 0.83/1.09 ============================== STATISTICS ============================
% 0.83/1.09
% 0.83/1.09 Given=102. Generated=1433. Kept=422. proofs=1.
% 0.83/1.09 Usable=93. Sos=250. Demods=165. Limbo=3, Disabled=112. Hints=0.
% 0.83/1.09 Megabytes=0.45.
% 0.83/1.09 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.83/1.09
% 0.83/1.09 ============================== end of statistics =====================
% 0.83/1.09
% 0.83/1.09 ============================== end of search =========================
% 0.83/1.09
% 0.83/1.09 THEOREM PROVED
% 0.83/1.09 % SZS status Theorem
% 0.83/1.09
% 0.83/1.09 Exiting with 1 proof.
% 0.83/1.09
% 0.83/1.09 Process 20350 exit (max_proofs) Thu Jun 16 10:37:19 2022
% 0.83/1.09 Prover9 interrupted
%------------------------------------------------------------------------------