TSTP Solution File: HWC003-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWC003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 13:07:31 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWC003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:07:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.13 ============================== Prover9 ===============================
% 0.71/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.13 Process 27861 was started by sandbox on n017.cluster.edu,
% 0.71/1.13 Thu Jun 9 12:07:50 2022
% 0.71/1.13 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27708_n017.cluster.edu".
% 0.71/1.13 ============================== end of head ===========================
% 0.71/1.13
% 0.71/1.13 ============================== INPUT =================================
% 0.71/1.13
% 0.71/1.13 % Reading from file /tmp/Prover9_27708_n017.cluster.edu
% 0.71/1.13
% 0.71/1.13 set(prolog_style_variables).
% 0.71/1.13 set(auto2).
% 0.71/1.13 % set(auto2) -> set(auto).
% 0.71/1.13 % set(auto) -> set(auto_inference).
% 0.71/1.13 % set(auto) -> set(auto_setup).
% 0.71/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.13 % set(auto) -> set(auto_limits).
% 0.71/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.13 % set(auto) -> set(auto_denials).
% 0.71/1.13 % set(auto) -> set(auto_process).
% 0.71/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.13 % set(auto2) -> assign(stats, some).
% 0.71/1.13 % set(auto2) -> clear(echo_input).
% 0.71/1.13 % set(auto2) -> set(quiet).
% 0.71/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.13 % set(auto2) -> clear(print_given).
% 0.71/1.13 assign(lrs_ticks,-1).
% 0.71/1.13 assign(sos_limit,10000).
% 0.71/1.13 assign(order,kbo).
% 0.71/1.13 set(lex_order_vars).
% 0.71/1.13 clear(print_given).
% 0.71/1.13
% 0.71/1.13 % formulas(sos). % not echoed (25 formulas)
% 0.71/1.13
% 0.71/1.13 ============================== end of input ==========================
% 0.71/1.13
% 0.71/1.13 % From the command line: assign(max_seconds, 300).
% 0.71/1.13
% 0.71/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.13
% 0.71/1.13 % Formulas that are not ordinary clauses:
% 0.71/1.13
% 0.71/1.13 ============================== end of process non-clausal formulas ===
% 0.71/1.13
% 0.71/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.13
% 0.71/1.13 ============================== PREDICATE ELIMINATION =================
% 0.71/1.13 1 -output(A,B,C,D,E,F,V6,V7,V8) | test(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7),add_inverter(V8,inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7))),make_reverse_list(list(inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7)),V8))) # label(inverter_test) # label(axiom). [assumption].
% 0.71/1.13 2 -test(A,B,C,D,E,F,V6,V7,V8,V9) | basic_output(A,B,C,D,E,F,V6,V7,V8) # label(create_test) # label(axiom). [assumption].
% 0.71/1.13 Derived: -output(A,B,C,D,E,F,V6,V7,V8) | basic_output(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7),add_inverter(V8,inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7)))). [resolve(1,b,2,a)].
% 0.71/1.13
% 0.71/1.13 ============================== end predicate elimination =============
% 0.71/1.13
% 0.71/1.13 Auto_denials:
% 0.71/1.13 % copying label prove_cannot_construct_this to answer in negative clause
% 0.71/1.13
% 0.71/1.13 Term ordering decisions:
% 0.71/1.13 Function symbol KB weights: n0=1. n1=1. not_reversion=1. end=1. r00m=1. r01m=1. r0m0=1. r0m1=1. r10m=1. r11m=1. r1m0=1. r1m1=1. rm00=1. rm01=1. rm10=1. rm11=1. list_reversion=1. and=1. or=1. add_inverter=1. list=1. not=1. make_reverse_list=1. possible_reversion=1. inverter_table=1.
% 0.71/1.13
% 0.71/1.13 ============================== end of process initial clauses ========
% 0.71/1.13
% 0.71/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.13
% 0.71/1.13 ============================== end of clauses for search =============
% 0.71/1.13
% 0.71/1.13 ============================== SEARCH ================================
% 0.71/1.13
% 0.71/1.13 % Starting search at 0.01 seconds.
% 0.71/1.13
% 0.71/1.13 ============================== PROOF =================================
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13 % SZS output start Refutation
% 0.71/1.13
% 0.71/1.13 % Proof 1 at 0.16 (+ 0.00) seconds: prove_cannot_construct_this.
% 0.71/1.13 % Length of proof is 25.
% 0.71/1.13 % Level of proof is 8.
% 0.71/1.13 % Maximum clause weight is 46.000.
% 0.71/1.13 % Given clauses 66.
% 0.71/1.13
% 0.71/1.13 1 -output(A,B,C,D,E,F,V6,V7,V8) | test(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7),add_inverter(V8,inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7))),make_reverse_list(list(inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7)),V8))) # label(inverter_test) # label(axiom). [assumption].
% 0.71/1.13 2 -test(A,B,C,D,E,F,V6,V7,V8,V9) | basic_output(A,B,C,D,E,F,V6,V7,V8) # label(create_test) # label(axiom). [assumption].
% 0.71/1.13 3 not(n0) = n1 # label(not_definition1) # label(axiom). [assumption].
% 0.71/1.13 4 not(n1) = n0 # label(not_definition2) # label(axiom). [assumption].
% 0.71/1.13 14 add_inverter(A,B) = list(B,A) # label(add_inverter_definition2) # label(axiom). [assumption].
% 0.71/1.13 16 output(n0,n0,n0,n0,n1,n1,n1,n1,A) # label(input1) # label(negated_conjecture). [assumption].
% 0.71/1.13 17 output(n0,n0,n1,n1,n0,n0,n1,n1,A) # label(input2) # label(negated_conjecture). [assumption].
% 0.71/1.13 18 output(n0,n1,n0,n1,n0,n1,n0,n1,A) # label(input3) # label(negated_conjecture). [assumption].
% 0.71/1.13 19 add_inverter(list(A,B),C) = list(A,add_inverter(B,C)) # label(add_inverter_definition1) # label(axiom). [assumption].
% 0.71/1.13 20 list(A,list(B,C)) = list(B,list(A,C)). [copy(19),rewrite([14(2),14(3)])].
% 0.71/1.13 24 -output(n1,n1,n1,n1,n0,n0,n0,n0,A) | -output(n1,n1,n0,n0,n1,n1,n0,n0,A) | -output(n1,n0,n1,n0,n1,n0,n1,n0,A) # label(prove_cannot_construct_this) # label(negated_conjecture) # answer(prove_cannot_construct_this). [assumption].
% 0.71/1.13 25 -basic_output(A,B,C,D,E,F,V6,V7,V8) | output(A,B,C,D,E,F,V6,V7,V8) # label(basic_output_definition) # label(axiom). [assumption].
% 0.71/1.13 28 -output(A,B,C,D,E,F,V6,V7,V8) | basic_output(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7),add_inverter(V8,inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7)))). [resolve(1,b,2,a)].
% 0.71/1.13 29 -output(A,B,C,D,E,F,V6,V7,V8) | basic_output(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7),list(inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(V6),not(V7)),V8)). [copy(28),rewrite([14(19)])].
% 0.71/1.13 78 basic_output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),A)). [hyper(29,a,18,a),rewrite([3(2),4(3),3(4),4(5),3(6),4(7),3(8),4(9),3(10),4(11),3(12),4(13),3(14),4(15),3(16),4(17)])].
% 0.71/1.13 79 basic_output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),A)). [hyper(29,a,17,a),rewrite([3(2),3(3),4(4),4(5),3(6),3(7),4(8),4(9),3(10),3(11),4(12),4(13),3(14),3(15),4(16),4(17)])].
% 0.71/1.13 80 basic_output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),A)). [hyper(29,a,16,a),rewrite([3(2),3(3),3(4),3(5),4(6),4(7),4(8),4(9),3(10),3(11),3(12),3(13),4(14),4(15),4(16),4(17)])].
% 0.71/1.13 124 output(n1,n0,n1,n0,n1,n0,n1,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),A)). [hyper(25,a,78,a)].
% 0.71/1.13 129 output(n1,n1,n0,n0,n1,n1,n0,n0,list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),A)). [hyper(25,a,79,a)].
% 0.71/1.13 174 basic_output(n1,n1,n1,n1,n0,n0,n0,n0,list(A,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),B))). [para(20(a,1),80(a,9))].
% 0.71/1.13 220 output(n1,n0,n1,n0,n1,n0,n1,n0,list(A,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),B))). [para(20(a,1),124(a,9))].
% 0.71/1.13 390 basic_output(n1,n1,n1,n1,n0,n0,n0,n0,list(A,list(B,list(inverter_table(n1,n1,n1,n1,n0,n0,n0,n0),C)))). [para(20(a,1),174(a,9,2))].
% 0.71/1.13 431 -output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),A))) # answer(prove_cannot_construct_this). [ur(24,b,129,a,c,220,a),rewrite([20(28)])].
% 0.71/1.13 468 -basic_output(n1,n1,n1,n1,n0,n0,n0,n0,list(inverter_table(n1,n0,n1,n0,n1,n0,n1,n0),list(inverter_table(n1,n1,n0,n0,n1,n1,n0,n0),A))) # answer(prove_cannot_construct_this). [ur(25,b,431,a)].
% 0.71/1.13 469 $F # answer(prove_cannot_construct_this). [resolve(468,a,390,a)].
% 0.71/1.13
% 0.71/1.13 % SZS output end Refutation
% 0.71/1.13 ============================== end of proof ==========================
% 0.71/1.13
% 0.71/1.13 ============================== STATISTICS ============================
% 0.71/1.13
% 0.71/1.13 Given=66. Generated=760. Kept=463. proofs=1.
% 0.71/1.13 Usable=66. Sos=396. Demods=388. Limbo=0, Disabled=26. Hints=0.
% 0.71/1.13 Megabytes=1.68.
% 0.71/1.13 User_CPU=0.16, System_CPU=0.00, Wall_clock=0.
% 0.71/1.13
% 0.71/1.13 ============================== end of statistics =====================
% 0.71/1.13
% 0.71/1.13 ============================== end of search =========================
% 0.71/1.13
% 0.71/1.13 THEOREM PROVED
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13
% 0.71/1.13 Exiting with 1 proof.
% 0.71/1.13
% 0.71/1.13 Process 27861 exit (max_proofs) Thu Jun 9 12:07:50 2022
% 0.71/1.13 Prover9 interrupted
%------------------------------------------------------------------------------