TSTP Solution File: HWV001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Sat Jul 16 19:01:05 EDT 2022
% Result : Unsatisfiable 0.89s 1.18s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 23:23:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.89/1.17 ============================== Prover9 ===============================
% 0.89/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.89/1.17 Process 5272 was started by sandbox on n029.cluster.edu,
% 0.89/1.17 Thu Jun 16 23:23:43 2022
% 0.89/1.17 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5119_n029.cluster.edu".
% 0.89/1.17 ============================== end of head ===========================
% 0.89/1.17
% 0.89/1.17 ============================== INPUT =================================
% 0.89/1.17
% 0.89/1.17 % Reading from file /tmp/Prover9_5119_n029.cluster.edu
% 0.89/1.17
% 0.89/1.17 set(prolog_style_variables).
% 0.89/1.17 set(auto2).
% 0.89/1.17 % set(auto2) -> set(auto).
% 0.89/1.17 % set(auto) -> set(auto_inference).
% 0.89/1.17 % set(auto) -> set(auto_setup).
% 0.89/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.89/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.89/1.17 % set(auto) -> set(auto_limits).
% 0.89/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.89/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.89/1.17 % set(auto) -> set(auto_denials).
% 0.89/1.17 % set(auto) -> set(auto_process).
% 0.89/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.89/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.89/1.18 % set(auto2) -> assign(max_weight, "200.000").
% 0.89/1.18 % set(auto2) -> assign(max_hours, 1).
% 0.89/1.18 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.89/1.18 % set(auto2) -> assign(max_seconds, 0).
% 0.89/1.18 % set(auto2) -> assign(max_minutes, 5).
% 0.89/1.18 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.89/1.18 % set(auto2) -> set(sort_initial_sos).
% 0.89/1.18 % set(auto2) -> assign(sos_limit, -1).
% 0.89/1.18 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.89/1.18 % set(auto2) -> assign(max_megs, 400).
% 0.89/1.18 % set(auto2) -> assign(stats, some).
% 0.89/1.18 % set(auto2) -> clear(echo_input).
% 0.89/1.18 % set(auto2) -> set(quiet).
% 0.89/1.18 % set(auto2) -> clear(print_initial_clauses).
% 0.89/1.18 % set(auto2) -> clear(print_given).
% 0.89/1.18 assign(lrs_ticks,-1).
% 0.89/1.18 assign(sos_limit,10000).
% 0.89/1.18 assign(order,kbo).
% 0.89/1.18 set(lex_order_vars).
% 0.89/1.18 clear(print_given).
% 0.89/1.18
% 0.89/1.18 % formulas(sos). % not echoed (47 formulas)
% 0.89/1.18
% 0.89/1.18 ============================== end of input ==========================
% 0.89/1.18
% 0.89/1.18 % From the command line: assign(max_seconds, 300).
% 0.89/1.18
% 0.89/1.18 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.89/1.18
% 0.89/1.18 % Formulas that are not ordinary clauses:
% 0.89/1.18
% 0.89/1.18 ============================== end of process non-clausal formulas ===
% 0.89/1.18
% 0.89/1.18 ============================== PROCESS INITIAL CLAUSES ===============
% 0.89/1.18
% 0.89/1.18 ============================== PREDICATE ELIMINATION =================
% 0.89/1.18
% 0.89/1.18 ============================== end predicate elimination =============
% 0.89/1.18
% 0.89/1.18 Auto_denials:
% 0.89/1.18 % copying label prove_interchange to answer in negative clause
% 0.89/1.18
% 0.89/1.18 Term ordering decisions:
% 0.89/1.18
% 0.89/1.18 % Assigning unary symbol not kb_weight 0 and highest precedence (26).
% 0.89/1.18 Function symbol KB weights: n0=1. n1=1. f3=1. b3=1. d1=1. d2=1. d3=1. i1=1. i2=1. a1=1. a2=1. b1=1. b2=1. c1=1. c2=1. e1=1. e2=1. f1=1. f2=1. and=1. or=1. input=1. output=1. not=0.
% 0.89/1.18
% 0.89/1.18 ============================== end of process initial clauses ========
% 0.89/1.18
% 0.89/1.18 ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.18
% 0.89/1.18 ============================== end of clauses for search =============
% 0.89/1.18
% 0.89/1.18 ============================== SEARCH ================================
% 0.89/1.18
% 0.89/1.18 % Starting search at 0.01 seconds.
% 0.89/1.18
% 0.89/1.18 ============================== PROOF =================================
% 0.89/1.18 % SZS status Unsatisfiable
% 0.89/1.18 % SZS output start Refutation
% 0.89/1.18
% 0.89/1.18 % Proof 1 at 0.18 (+ 0.01) seconds: prove_interchange.
% 0.89/1.18 % Length of proof is 124.
% 0.89/1.18 % Level of proof is 14.
% 0.89/1.18 % Maximum clause weight is 15.000.
% 0.89/1.18 % Given clauses 278.
% 0.89/1.18
% 0.89/1.18 1 d3 = f3 # label(constructor8) # label(negated_conjecture). [assumption].
% 0.89/1.18 2 not(n0) = n1 # label(not_definition1) # label(axiom). [assumption].
% 0.89/1.18 4 b1 = not(d1) # label(constructor3) # label(negated_conjecture). [assumption].
% 0.89/1.18 5 not(d1) = b1. [copy(4),flip(a)].
% 0.89/1.18 6 b2 = not(d2) # label(constructor4) # label(negated_conjecture). [assumption].
% 0.89/1.18 7 not(d2) = b2. [copy(6),flip(a)].
% 0.89/1.18 8 d1 = not(e1) # label(constructor9) # label(negated_conjecture). [assumption].
% 0.89/1.18 9 not(e1) = d1. [copy(8),flip(a)].
% 0.89/1.18 10 d2 = not(e2) # label(constructor10) # label(negated_conjecture). [assumption].
% 0.89/1.18 11 not(e2) = d2. [copy(10),flip(a)].
% 0.89/1.18 12 f1 = not(i1) # label(constructor13) # label(negated_conjecture). [assumption].
% 0.89/1.18 13 not(i1) = f1. [copy(12),flip(a)].
% 0.89/1.18 14 f2 = not(i2) # label(constructor14) # label(negated_conjecture). [assumption].
% 0.89/1.18 15 not(i2) = f2. [copy(14),flip(a)].
% 0.89/1.18 16 and(A,n0) = n0 # label(and_definition1) # label(axiom). [assumption].
% 0.89/1.18 17 and(A,n1) = A # label(and_definition2) # label(axiom). [assumption].
% 0.89/1.18 18 or(A,n0) = A # label(or_definition1) # label(axiom). [assumption].
% 0.89/1.18 19 or(A,n1) = n1 # label(or_definition2) # label(axiom). [assumption].
% 0.89/1.18 20 and(A,A) = A # label(and_simplification1) # label(axiom). [assumption].
% 0.89/1.18 22 not(not(A)) = A # label(not_simplification) # label(axiom). [assumption].
% 0.89/1.18 23 a1 = and(b1,b3) # label(constructor1) # label(negated_conjecture). [assumption].
% 0.89/1.18 24 and(b1,b3) = a1. [copy(23),flip(a)].
% 0.89/1.18 25 a2 = and(b2,b3) # label(constructor2) # label(negated_conjecture). [assumption].
% 0.89/1.18 26 and(b2,b3) = a2. [copy(25),flip(a)].
% 0.89/1.18 27 b3 = or(c1,c2) # label(constructor5) # label(negated_conjecture). [assumption].
% 0.89/1.18 28 or(c1,c2) = b3. [copy(27),flip(a)].
% 0.89/1.18 29 c1 = or(d1,d3) # label(constructor6) # label(negated_conjecture). [assumption].
% 0.89/1.18 30 or(d1,f3) = c1. [copy(29),rewrite([1(3)]),flip(a)].
% 0.89/1.18 31 c2 = or(d2,d3) # label(constructor7) # label(negated_conjecture). [assumption].
% 0.89/1.18 32 or(d2,f3) = c2. [copy(31),rewrite([1(3)]),flip(a)].
% 0.89/1.18 33 e1 = or(f1,f3) # label(constructor11) # label(negated_conjecture). [assumption].
% 0.89/1.18 34 or(f1,f3) = e1. [copy(33),flip(a)].
% 0.89/1.18 35 e2 = or(f2,f3) # label(constructor12) # label(negated_conjecture). [assumption].
% 0.89/1.18 36 or(f2,f3) = e2. [copy(35),flip(a)].
% 0.89/1.18 37 f3 = and(i1,i2) # label(constructor15) # label(negated_conjecture). [assumption].
% 0.89/1.18 38 and(i1,i2) = f3. [copy(37),flip(a)].
% 0.89/1.18 39 and(A,not(A)) = n0 # label(and_not_simplification1) # label(axiom). [assumption].
% 0.89/1.18 40 or(A,not(A)) = n1 # label(or_not_simplification1) # label(axiom). [assumption].
% 0.89/1.18 41 and(A,B) = and(B,A) # label(and_commutativity) # label(axiom). [assumption].
% 0.89/1.18 42 or(A,B) = or(B,A) # label(or_commutativity) # label(axiom). [assumption].
% 0.89/1.18 43 circuit(input(i1,i2),output(a1,a2)) # label(circuit_description) # label(negated_conjecture). [assumption].
% 0.89/1.18 50 and(and(A,B),B) = and(A,B) # label(and_simplification2) # label(axiom). [assumption].
% 0.89/1.18 51 and(A,and(A,B)) = and(A,B). [copy(50),rewrite([41(2)]),rewrite([41(1),41(3)])].
% 0.89/1.18 53 or(or(A,B),B) = or(A,B) # label(or_simplification2) # label(axiom). [assumption].
% 0.89/1.18 54 or(A,or(A,B)) = or(A,B). [copy(53),rewrite([42(2)]),rewrite([42(1),42(3)])].
% 0.89/1.18 56 not(and(A,B)) = or(not(A),not(B)) # label(not_canonicalization1) # label(axiom). [assumption].
% 0.89/1.18 57 not(or(A,B)) = and(not(A),not(B)) # label(not_canonicalization2) # label(axiom). [assumption].
% 0.89/1.18 58 or(and(A,B),and(A,not(B))) = A # label(and_or_not_simplification1) # label(axiom). [assumption].
% 0.89/1.18 60 and(A,and(B,C)) = and(and(A,B),C) # label(and_associativity) # label(axiom). [assumption].
% 0.89/1.18 61 and(A,and(B,C)) = and(C,and(A,B)). [copy(60),rewrite([41(4)])].
% 0.89/1.18 62 or(A,or(B,C)) = or(or(A,B),C) # label(or_associativity) # label(axiom). [assumption].
% 0.89/1.18 63 or(A,or(B,C)) = or(C,or(A,B)). [copy(62),rewrite([42(4)])].
% 0.89/1.18 66 and(or(A,B),C) = or(and(A,C),and(B,C)) # label(and_or_canonicalization) # label(axiom). [assumption].
% 0.89/1.18 67 or(and(A,B),and(B,C)) = and(B,or(A,C)). [copy(66),rewrite([41(2)]),flip(a),rewrite([41(2)])].
% 0.89/1.18 68 -circuit(input(i1,i2),output(i2,i1)) # label(prove_interchange) # label(negated_conjecture) # answer(prove_interchange). [assumption].
% 0.89/1.18 69 and(b3,b2) = a2. [back_rewrite(26),rewrite([41(3)])].
% 0.89/1.18 70 and(b3,b1) = a1. [back_rewrite(24),rewrite([41(3)])].
% 0.89/1.18 71 or(f3,f2) = e2. [back_rewrite(36),rewrite([42(3)])].
% 0.89/1.18 72 or(f3,f1) = e1. [back_rewrite(34),rewrite([42(3)])].
% 0.89/1.18 73 or(f3,d2) = c2. [back_rewrite(32),rewrite([42(3)])].
% 0.89/1.18 74 or(f3,d1) = c1. [back_rewrite(30),rewrite([42(3)])].
% 0.89/1.18 75 not(b1) = d1. [para(5(a,1),22(a,1,1))].
% 0.89/1.18 76 not(b2) = d2. [para(7(a,1),22(a,1,1))].
% 0.89/1.18 77 e1 = b1. [para(9(a,1),22(a,1,1)),rewrite([5(2)]),flip(a)].
% 0.89/1.18 78 e2 = b2. [para(11(a,1),22(a,1,1)),rewrite([7(2)]),flip(a)].
% 0.89/1.18 79 not(f1) = i1. [para(13(a,1),22(a,1,1))].
% 0.89/1.18 80 not(f2) = i2. [para(15(a,1),22(a,1,1))].
% 0.89/1.18 81 or(f3,f1) = b1. [back_rewrite(72),rewrite([77(4)])].
% 0.89/1.18 82 or(f3,f2) = b2. [back_rewrite(71),rewrite([78(4)])].
% 0.89/1.18 86 and(i2,f2) = n0. [para(15(a,1),39(a,1,2))].
% 0.89/1.18 95 or(f1,f2) = not(f3). [para(38(a,1),56(a,1,1)),rewrite([13(4),15(5)]),flip(a)].
% 0.89/1.18 97 or(not(A),or(not(B),and(A,B))) = n1. [para(56(a,1),40(a,1,2)),rewrite([63(5),42(4),63(5,R),42(4)])].
% 0.89/1.18 109 or(f3,and(i1,f2)) = i1. [para(38(a,1),58(a,1,1)),rewrite([15(4)])].
% 0.89/1.18 111 or(A,and(A,B)) = A. [para(58(a,1),54(a,1,2)),rewrite([42(2),58(6)])].
% 0.89/1.18 115 and(A,and(B,not(A))) = n0. [para(39(a,1),61(a,2,2)),rewrite([41(2),16(5)])].
% 0.89/1.18 117 or(and(A,and(B,C)),and(C,or(not(A),not(B)))) = C. [para(61(a,2),58(a,1,1)),rewrite([56(4)])].
% 0.89/1.18 120 or(n0,and(A,B)) = and(A,B). [para(16(a,1),67(a,1,2)),rewrite([42(3),18(5),41(4)])].
% 0.89/1.18 122 or(A,and(B,A)) = A. [para(17(a,1),67(a,1,2)),rewrite([42(2),19(4),17(4)])].
% 0.89/1.18 123 and(A,or(A,B)) = A. [para(20(a,1),67(a,1,1)),rewrite([111(2)]),flip(a)].
% 0.89/1.18 124 and(A,or(B,A)) = A. [para(20(a,1),67(a,1,2)),rewrite([42(2),122(2)]),flip(a)].
% 0.89/1.18 128 and(not(A),or(A,B)) = and(B,not(A)). [para(39(a,1),67(a,1,1)),rewrite([41(3),120(4)]),flip(a)].
% 0.89/1.18 129 and(A,or(B,not(A))) = and(B,A). [para(39(a,1),67(a,1,2)),rewrite([42(3),120(3)]),flip(a)].
% 0.89/1.18 143 and(b3,a1) = a1. [para(70(a,1),51(a,1,2)),rewrite([70(6)])].
% 0.89/1.18 144 or(d1,not(b3)) = not(a1). [para(70(a,1),56(a,1,1)),rewrite([75(6),42(6)]),flip(a)].
% 0.89/1.18 145 or(a1,and(A,b1)) = and(b1,or(A,b3)). [para(70(a,1),67(a,1,1)),rewrite([41(3),42(7)])].
% 0.89/1.18 148 and(b2,not(f3)) = not(c2). [para(73(a,1),57(a,1,1)),rewrite([7(6),41(6)]),flip(a)].
% 0.89/1.18 150 and(b1,not(f3)) = not(c1). [para(74(a,1),57(a,1,1)),rewrite([5(6),41(6)]),flip(a)].
% 0.89/1.18 152 and(i1,not(f3)) = d1. [para(81(a,1),57(a,1,1)),rewrite([75(2),79(5),41(5)]),flip(a)].
% 0.89/1.18 154 and(i2,not(f3)) = d2. [para(82(a,1),57(a,1,1)),rewrite([76(2),80(5),41(5)]),flip(a)].
% 0.89/1.18 166 and(i2,or(A,f2)) = and(A,i2). [para(86(a,1),67(a,1,2)),rewrite([42(4),120(4)]),flip(a)].
% 0.89/1.18 311 or(f3,i1) = i1. [para(109(a,1),54(a,1,2)),rewrite([109(8)])].
% 0.89/1.18 315 and(f1,not(f3)) = f1. [para(311(a,1),57(a,1,1)),rewrite([13(2),13(5),41(5)]),flip(a)].
% 0.89/1.18 357 or(A,or(not(A),not(B))) = n1. [para(115(a,1),56(a,1,1)),rewrite([2(2),56(5),22(5),42(4),63(5,R),42(4)]),flip(a)].
% 0.89/1.18 427 and(n1,a1) = a1. [para(143(a,1),117(a,1,1,2)),rewrite([67(9),357(6),41(3)])].
% 0.89/1.18 468 or(f3,i2) = i2. [para(38(a,1),122(a,1,2)),rewrite([42(3)])].
% 0.89/1.18 474 and(f2,not(f3)) = f2. [para(468(a,1),57(a,1,1)),rewrite([15(2),15(5),41(5)]),flip(a)].
% 0.89/1.18 475 and(b3,c1) = c1. [para(28(a,1),123(a,1,2)),rewrite([41(3)])].
% 0.89/1.18 497 and(b3,c2) = c2. [para(28(a,1),124(a,1,2)),rewrite([41(3)])].
% 0.89/1.18 520 and(c2,not(c1)) = and(b3,not(c1)). [para(28(a,1),128(a,1,2)),rewrite([41(4)]),flip(a)].
% 0.89/1.18 530 not(c1) = f1. [para(81(a,1),128(a,1,2)),rewrite([41(4),150(4),315(6)])].
% 0.89/1.18 531 not(c2) = f2. [para(82(a,1),128(a,1,2)),rewrite([41(4),148(4),474(6)])].
% 0.89/1.18 533 and(i1,f2) = d1. [para(95(a,1),128(a,1,2)),rewrite([79(2),152(4),79(4),41(4)]),flip(a)].
% 0.89/1.18 544 and(c2,f1) = and(b3,f1). [back_rewrite(520),rewrite([530(3),530(6)])].
% 0.89/1.18 556 c1 = i1. [back_rewrite(109),rewrite([533(4),74(3)])].
% 0.89/1.18 563 and(b3,i1) = i1. [back_rewrite(475),rewrite([556(2),556(4)])].
% 0.89/1.18 568 or(i1,c2) = b3. [back_rewrite(28),rewrite([556(1)])].
% 0.89/1.18 569 c2 = i2. [para(531(a,1),22(a,1,1)),rewrite([80(2)]),flip(a)].
% 0.89/1.18 570 or(i1,i2) = b3. [back_rewrite(568),rewrite([569(2)])].
% 0.89/1.18 573 and(i2,f1) = and(b3,f1). [back_rewrite(544),rewrite([569(1)])].
% 0.89/1.18 576 and(b3,i2) = i2. [back_rewrite(497),rewrite([569(2),569(4)])].
% 0.89/1.18 600 or(i2,f1) = b1. [para(533(a,1),56(a,1,1)),rewrite([5(2),13(3),80(4),42(4)]),flip(a)].
% 0.89/1.18 605 and(b3,f2) = d1. [para(533(a,1),129(a,2)),rewrite([80(4),570(4),41(3)])].
% 0.89/1.18 631 or(b3,i2) = b3. [para(576(a,1),111(a,1,2))].
% 0.89/1.18 679 and(i2,b1) = i2. [para(600(a,1),123(a,1,2))].
% 0.89/1.18 757 or(i2,not(a1)) = n1. [para(605(a,1),97(a,1,2,2)),rewrite([80(4),42(5),63(6),42(5),144(5)])].
% 0.89/1.18 849 or(i2,a1) = a1. [para(679(a,1),145(a,1,2)),rewrite([42(3),42(7),631(7),41(6),70(6)])].
% 0.89/1.18 858 and(i2,a1) = i2. [para(849(a,1),123(a,1,2))].
% 0.89/1.18 874 a1 = i2. [para(858(a,1),129(a,2)),rewrite([757(5),41(3),427(3)])].
% 0.89/1.18 893 circuit(input(i1,i2),output(i2,a2)). [back_rewrite(43),rewrite([874(4)])].
% 0.89/1.18 983 and(b3,f1) = d2. [para(95(a,1),166(a,1,2)),rewrite([154(4),41(4),573(4)]),flip(a)].
% 0.89/1.18 991 or(i1,not(b3)) = b2. [para(983(a,1),56(a,1,1)),rewrite([7(2),79(5),42(5)]),flip(a)].
% 0.89/1.18 1029 a2 = i1. [para(991(a,1),129(a,1,2)),rewrite([69(3),41(4),563(4)])].
% 0.89/1.18 1031 circuit(input(i1,i2),output(i2,i1)). [back_rewrite(893),rewrite([1029(5)])].
% 0.89/1.18 1032 $F # answer(prove_interchange). [resolve(1031,a,68,a)].
% 0.89/1.18
% 0.89/1.18 % SZS output end Refutation
% 0.89/1.18 ============================== end of proof ==========================
% 0.89/1.18
% 0.89/1.18 ============================== STATISTICS ============================
% 0.89/1.18
% 0.89/1.18 Given=278. Generated=7230. Kept=1004. proofs=1.
% 0.89/1.18 Usable=224. Sos=458. Demods=683. Limbo=2, Disabled=366. Hints=0.
% 0.89/1.18 Megabytes=0.74.
% 0.89/1.18 User_CPU=0.19, System_CPU=0.01, Wall_clock=0.
% 0.89/1.18
% 0.89/1.18 ============================== end of statistics =====================
% 0.89/1.18
% 0.89/1.18 ============================== end of search =========================
% 0.89/1.18
% 0.89/1.18 THEOREM PROVED
% 0.89/1.18 % SZS status Unsatisfiable
% 0.89/1.18
% 0.89/1.18 Exiting with 1 proof.
% 0.89/1.18
% 0.89/1.18 Process 5272 exit (max_proofs) Thu Jun 16 23:23:43 2022
% 0.89/1.18 Prover9 interrupted
%------------------------------------------------------------------------------