TSTP Solution File: HWC002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 1.17s 1.43s
% Output : Refutation 1.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:57:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.17/1.43 ============================== Prover9 ===============================
% 1.17/1.43 Prover9 (32) version 2009-11A, November 2009.
% 1.17/1.43 Process 12127 was started by sandbox on n025.cluster.edu,
% 1.17/1.43 Thu Jun 9 12:57:51 2022
% 1.17/1.43 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11974_n025.cluster.edu".
% 1.17/1.43 ============================== end of head ===========================
% 1.17/1.43
% 1.17/1.43 ============================== INPUT =================================
% 1.17/1.43
% 1.17/1.43 % Reading from file /tmp/Prover9_11974_n025.cluster.edu
% 1.17/1.43
% 1.17/1.43 set(prolog_style_variables).
% 1.17/1.43 set(auto2).
% 1.17/1.43 % set(auto2) -> set(auto).
% 1.17/1.43 % set(auto) -> set(auto_inference).
% 1.17/1.43 % set(auto) -> set(auto_setup).
% 1.17/1.43 % set(auto_setup) -> set(predicate_elim).
% 1.17/1.43 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.17/1.43 % set(auto) -> set(auto_limits).
% 1.17/1.43 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.17/1.43 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.17/1.43 % set(auto) -> set(auto_denials).
% 1.17/1.43 % set(auto) -> set(auto_process).
% 1.17/1.43 % set(auto2) -> assign(new_constants, 1).
% 1.17/1.43 % set(auto2) -> assign(fold_denial_max, 3).
% 1.17/1.43 % set(auto2) -> assign(max_weight, "200.000").
% 1.17/1.43 % set(auto2) -> assign(max_hours, 1).
% 1.17/1.43 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.17/1.43 % set(auto2) -> assign(max_seconds, 0).
% 1.17/1.43 % set(auto2) -> assign(max_minutes, 5).
% 1.17/1.43 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.17/1.43 % set(auto2) -> set(sort_initial_sos).
% 1.17/1.43 % set(auto2) -> assign(sos_limit, -1).
% 1.17/1.43 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.17/1.43 % set(auto2) -> assign(max_megs, 400).
% 1.17/1.43 % set(auto2) -> assign(stats, some).
% 1.17/1.43 % set(auto2) -> clear(echo_input).
% 1.17/1.43 % set(auto2) -> set(quiet).
% 1.17/1.43 % set(auto2) -> clear(print_initial_clauses).
% 1.17/1.43 % set(auto2) -> clear(print_given).
% 1.17/1.43 assign(lrs_ticks,-1).
% 1.17/1.43 assign(sos_limit,10000).
% 1.17/1.43 assign(order,kbo).
% 1.17/1.43 set(lex_order_vars).
% 1.17/1.43 clear(print_given).
% 1.17/1.43
% 1.17/1.43 % formulas(sos). % not echoed (38 formulas)
% 1.17/1.43
% 1.17/1.43 ============================== end of input ==========================
% 1.17/1.43
% 1.17/1.43 % From the command line: assign(max_seconds, 300).
% 1.17/1.43
% 1.17/1.43 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.17/1.43
% 1.17/1.43 % Formulas that are not ordinary clauses:
% 1.17/1.43
% 1.17/1.43 ============================== end of process non-clausal formulas ===
% 1.17/1.43
% 1.17/1.43 ============================== PROCESS INITIAL CLAUSES ===============
% 1.17/1.43
% 1.17/1.43 ============================== PREDICATE ELIMINATION =================
% 1.17/1.43
% 1.17/1.43 ============================== end predicate elimination =============
% 1.17/1.43
% 1.17/1.43 Auto_denials:
% 1.17/1.43 % copying label prove_output_configuration to answer in negative clause
% 1.17/1.43
% 1.17/1.43 Term ordering decisions:
% 1.17/1.43 Function symbol KB weights: n0=1. n1=1. nil=1. connect=1. and=1. or=1. bottom=1. top=1. middle=1. not=1. table=1.
% 1.17/1.43
% 1.17/1.43 ============================== end of process initial clauses ========
% 1.17/1.43
% 1.17/1.43 ============================== CLAUSES FOR SEARCH ====================
% 1.17/1.43
% 1.17/1.43 ============================== end of clauses for search =============
% 1.17/1.43
% 1.17/1.43 ============================== SEARCH ================================
% 1.17/1.43
% 1.17/1.43 % Starting search at 0.01 seconds.
% 1.17/1.43
% 1.17/1.43 ============================== PROOF =================================
% 1.17/1.43 % SZS status Unsatisfiable
% 1.17/1.43 % SZS output start Refutation
% 1.17/1.43
% 1.17/1.43 % Proof 1 at 0.44 (+ 0.01) seconds: prove_output_configuration.
% 1.17/1.43 % Length of proof is 36.
% 1.17/1.43 % Level of proof is 10.
% 1.17/1.43 % Maximum clause weight is 25.000.
% 1.17/1.43 % Given clauses 110.
% 1.17/1.43
% 1.17/1.43 1 not(n0) = n1 # label(not_definition1) # label(axiom). [assumption].
% 1.17/1.43 2 not(n1) = n0 # label(not_definition2) # label(axiom). [assumption].
% 1.17/1.43 3 not(nil) = nil # label(not_definition3) # label(axiom). [assumption].
% 1.17/1.43 4 and(n0,n0) = n0 # label(and_definition1) # label(axiom). [assumption].
% 1.17/1.43 5 and(n0,n1) = n0 # label(and_definition2) # label(axiom). [assumption].
% 1.17/1.43 12 and(nil,A) = A # label(and_definition5) # label(axiom). [assumption].
% 1.17/1.43 14 connect(nil,A) = A # label(connect_definition1) # label(axiom). [assumption].
% 1.17/1.43 15 circuit(top(A),B,bottom(A)) # label(subsume_symmetric) # label(axiom). [assumption].
% 1.17/1.43 16 table(n0,n0,n0,n0) = nil # label(empty_table) # label(axiom). [assumption].
% 1.17/1.43 17 table(n1,n1,n1,n1) = nil # label(full_table) # label(axiom). [assumption].
% 1.17/1.43 19 not(table(A,B,C,D)) = table(not(A),not(B),not(C),not(D)) # label(not_table_definition) # label(axiom). [assumption].
% 1.17/1.43 20 table(not(A),not(B),not(C),not(D)) = not(table(A,B,C,D)). [copy(19),flip(a)].
% 1.17/1.43 22 and(table(A,B,C,D),table(E,F,V6,V7)) = table(and(A,E),and(B,F),and(C,V6),and(D,V7)) # label(and_table_definition) # label(axiom). [assumption].
% 1.17/1.43 23 table(and(A,B),and(C,D),and(E,F),and(V6,V7)) = and(table(A,C,E,V6),table(B,D,F,V7)). [copy(22),flip(a)].
% 1.17/1.43 26 -circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))) # label(prove_output_configuration) # label(negated_conjecture) # answer(prove_output_configuration). [assumption].
% 1.17/1.43 42 table(n1,not(A),not(B),not(C)) = not(table(n0,A,B,C)). [para(1(a,1),20(a,1,1))].
% 1.17/1.43 54 table(n0,and(A,B),and(C,D),and(E,F)) = and(table(n0,A,C,E),table(n0,B,D,F)). [para(4(a,1),23(a,1,1))].
% 1.17/1.43 55 table(and(A,B),n0,and(C,D),and(E,F)) = and(table(A,n0,C,E),table(B,n0,D,F)). [para(4(a,1),23(a,1,2))].
% 1.17/1.43 56 table(and(A,B),and(C,D),n0,and(E,F)) = and(table(A,C,n0,E),table(B,D,n0,F)). [para(4(a,1),23(a,1,3))].
% 1.17/1.43 58 and(table(n0,A,B,C),table(n1,D,E,F)) = and(table(n0,A,B,C),table(n0,D,E,F)). [para(5(a,1),23(a,1,1)),rewrite([54(5)]),flip(a)].
% 1.17/1.43 59 and(table(A,n0,B,C),table(D,n1,E,F)) = and(table(A,n0,B,C),table(D,n0,E,F)). [para(5(a,1),23(a,1,2)),rewrite([55(5)]),flip(a)].
% 1.17/1.43 60 and(table(A,B,n0,C),table(D,E,n1,F)) = and(table(A,B,n0,C),table(D,E,n0,F)). [para(5(a,1),23(a,1,3)),rewrite([56(5)]),flip(a)].
% 1.17/1.43 189 table(n1,n1,not(A),not(B)) = not(table(n0,n0,A,B)). [para(1(a,1),42(a,1,2))].
% 1.17/1.43 199 table(n1,n1,not(A),n1) = not(table(n0,n0,A,n0)). [para(1(a,1),189(a,1,4))].
% 1.17/1.43 242 not(table(n0,n0,n1,n0)) = table(n1,n1,n0,n1). [para(2(a,1),199(a,1,3)),flip(a)].
% 1.17/1.43 1922 table(n1,A,B,C) = table(n0,A,B,C). [para(16(a,1),58(a,1,1)),rewrite([12(4),16(7),12(6)])].
% 1.17/1.43 3492 not(table(n0,n0,n1,n0)) = table(n0,n1,n0,n1). [back_rewrite(242),rewrite([1922(11)])].
% 1.17/1.43 3521 table(n0,n1,n1,n1) = nil. [back_rewrite(17),rewrite([1922(5)])].
% 1.17/1.43 3523 table(A,n1,B,C) = table(A,n0,B,C). [para(16(a,1),59(a,1,1)),rewrite([12(4),16(7),12(6)])].
% 1.17/1.43 3526 table(n0,n0,n1,n1) = nil. [back_rewrite(3521),rewrite([3523(5)])].
% 1.17/1.43 3531 not(table(n0,n0,n1,n0)) = table(n0,n0,n0,n1). [back_rewrite(3492),rewrite([3523(11)])].
% 1.17/1.43 4009 -circuit(top(connect(table(n0,n0,n0,n1),nil)),nil,bottom(nil)) # answer(prove_output_configuration). [back_rewrite(26),rewrite([3523(5),3526(14),14(12)])].
% 1.17/1.43 4012 table(A,B,n1,C) = table(A,B,n0,C). [para(16(a,1),60(a,1,1)),rewrite([12(4),16(7),12(6)])].
% 1.17/1.43 4209 table(n0,n0,n0,n1) = nil. [back_rewrite(3531),rewrite([4012(5),16(5),3(2)]),flip(a)].
% 1.17/1.43 4349 -circuit(top(nil),nil,bottom(nil)) # answer(prove_output_configuration). [back_rewrite(4009),rewrite([4209(5),14(3)])].
% 1.17/1.43 4350 $F # answer(prove_output_configuration). [resolve(4349,a,15,a)].
% 1.17/1.43
% 1.17/1.43 % SZS output end Refutation
% 1.17/1.43 ============================== end of proof ==========================
% 1.17/1.43
% 1.17/1.43 ============================== STATISTICS ============================
% 1.17/1.43
% 1.17/1.43 Given=110. Generated=6404. Kept=4346. proofs=1.
% 1.17/1.43 Usable=42. Sos=383. Demods=495. Limbo=140, Disabled=3818. Hints=0.
% 1.17/1.43 Megabytes=3.59.
% 1.17/1.43 User_CPU=0.44, System_CPU=0.01, Wall_clock=0.
% 1.17/1.43
% 1.17/1.43 ============================== end of statistics =====================
% 1.17/1.43
% 1.17/1.43 ============================== end of search =========================
% 1.17/1.43
% 1.17/1.43 THEOREM PROVED
% 1.17/1.43 % SZS status Unsatisfiable
% 1.17/1.43
% 1.17/1.43 Exiting with 1 proof.
% 1.17/1.43
% 1.17/1.43 Process 12127 exit (max_proofs) Thu Jun 9 12:57:51 2022
% 1.17/1.43 Prover9 interrupted
%------------------------------------------------------------------------------