TSTP Solution File: BOO075-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Thu Jul 14 23:48:08 EDT 2022
% Result : Unsatisfiable 0.69s 1.07s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 : Wed Jun 1 20:24:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.07 ============================== Prover9 ===============================
% 0.69/1.07 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.07 Process 32142 was started by sandbox2 on n020.cluster.edu,
% 0.69/1.07 Wed Jun 1 20:24:39 2022
% 0.69/1.07 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31989_n020.cluster.edu".
% 0.69/1.07 ============================== end of head ===========================
% 0.69/1.07
% 0.69/1.07 ============================== INPUT =================================
% 0.69/1.07
% 0.69/1.07 % Reading from file /tmp/Prover9_31989_n020.cluster.edu
% 0.69/1.07
% 0.69/1.07 set(prolog_style_variables).
% 0.69/1.07 set(auto2).
% 0.69/1.07 % set(auto2) -> set(auto).
% 0.69/1.07 % set(auto) -> set(auto_inference).
% 0.69/1.07 % set(auto) -> set(auto_setup).
% 0.69/1.07 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.07 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.07 % set(auto) -> set(auto_limits).
% 0.69/1.07 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.07 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.07 % set(auto) -> set(auto_denials).
% 0.69/1.07 % set(auto) -> set(auto_process).
% 0.69/1.07 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.07 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.07 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.07 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.07 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.07 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.07 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.07 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.07 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.07 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.07 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.07 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.07 % set(auto2) -> assign(stats, some).
% 0.69/1.07 % set(auto2) -> clear(echo_input).
% 0.69/1.07 % set(auto2) -> set(quiet).
% 0.69/1.07 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.07 % set(auto2) -> clear(print_given).
% 0.69/1.07 assign(lrs_ticks,-1).
% 0.69/1.07 assign(sos_limit,10000).
% 0.69/1.07 assign(order,kbo).
% 0.69/1.07 set(lex_order_vars).
% 0.69/1.07 clear(print_given).
% 0.69/1.07
% 0.69/1.07 % formulas(sos). % not echoed (2 formulas)
% 0.69/1.07
% 0.69/1.07 ============================== end of input ==========================
% 0.69/1.07
% 0.69/1.07 % From the command line: assign(max_seconds, 300).
% 0.69/1.07
% 0.69/1.07 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.07
% 0.69/1.07 % Formulas that are not ordinary clauses:
% 0.69/1.07
% 0.69/1.07 ============================== end of process non-clausal formulas ===
% 0.69/1.07
% 0.69/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.07
% 0.69/1.07 ============================== PREDICATE ELIMINATION =================
% 0.69/1.07
% 0.69/1.07 ============================== end predicate elimination =============
% 0.69/1.07
% 0.69/1.07 Auto_denials:
% 0.69/1.07 % copying label prove_meredith_2_basis_1 to answer in negative clause
% 0.69/1.07
% 0.69/1.07 Term ordering decisions:
% 0.69/1.07 Function symbol KB weights: a=1. b=1. nand=1.
% 0.69/1.07
% 0.69/1.07 ============================== end of process initial clauses ========
% 0.69/1.07
% 0.69/1.07 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.07
% 0.69/1.07 ============================== end of clauses for search =============
% 0.69/1.07
% 0.69/1.07 ============================== SEARCH ================================
% 0.69/1.07
% 0.69/1.07 % Starting search at 0.01 seconds.
% 0.69/1.07
% 0.69/1.07 ============================== PROOF =================================
% 0.69/1.07 % SZS status Unsatisfiable
% 0.69/1.07 % SZS output start Refutation
% 0.69/1.07
% 0.69/1.07 % Proof 1 at 0.11 (+ 0.00) seconds: prove_meredith_2_basis_1.
% 0.69/1.07 % Length of proof is 13.
% 0.69/1.07 % Level of proof is 7.
% 0.69/1.07 % Maximum clause weight is 37.000.
% 0.69/1.07 % Given clauses 17.
% 0.69/1.07
% 0.69/1.07 1 nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B # label(sh_1) # label(axiom). [assumption].
% 0.69/1.07 2 nand(nand(a,a),nand(b,a)) != a # label(prove_meredith_2_basis_1) # label(negated_conjecture) # answer(prove_meredith_2_basis_1). [assumption].
% 0.69/1.07 3 nand(nand(nand(A,nand(B,C)),nand(A,nand(A,nand(B,C)))),nand(nand(C,nand(nand(A,C),C)),nand(D,nand(A,nand(B,C))))) = nand(C,nand(nand(A,C),C)). [para(1(a,1),1(a,1,1,2,1))].
% 0.69/1.07 4 nand(nand(nand(A,nand(B,C)),nand(nand(D,nand(A,nand(B,C))),nand(A,nand(B,C)))),nand(D,A)) = D. [para(1(a,1),1(a,1,2,2))].
% 0.69/1.07 5 nand(nand(nand(A,B),nand(nand(nand(B,nand(nand(C,B),B)),nand(A,B)),nand(A,B))),C) = nand(B,nand(nand(C,B),B)). [para(1(a,1),1(a,1,2))].
% 0.69/1.07 16 nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,nand(nand(A,C),C)))) = B. [para(1(a,1),4(a,1,1,1)),rewrite([1(6),1(7)])].
% 0.69/1.07 35 nand(nand(A,nand(nand(nand(B,nand(nand(B,B),B)),A),A)),B) = nand(B,nand(nand(B,B),B)). [para(1(a,1),16(a,1,2))].
% 0.69/1.07 39 nand(A,nand(nand(A,A),A)) = nand(A,A). [para(16(a,1),3(a,1,2)),rewrite([16(8)]),flip(a)].
% 0.69/1.07 51 nand(nand(A,nand(nand(nand(B,B),A),A)),B) = nand(B,B). [back_rewrite(35),rewrite([39(3),39(8)])].
% 0.69/1.07 54 nand(nand(A,A),nand(A,A)) = A. [para(39(a,1),1(a,1,2)),rewrite([39(3)])].
% 0.69/1.07 149 nand(A,nand(nand(nand(nand(B,A),nand(B,A)),A),A)) = nand(B,A). [para(51(a,1),5(a,1,1,2,1)),rewrite([39(7),54(7)]),flip(a)].
% 0.69/1.07 184 nand(nand(A,A),nand(B,A)) = A. [para(149(a,1),1(a,1,2)),rewrite([39(3)])].
% 0.69/1.07 185 $F # answer(prove_meredith_2_basis_1). [resolve(184,a,2,a)].
% 0.69/1.07
% 0.69/1.07 % SZS output end Refutation
% 0.69/1.07 ============================== end of proof ==========================
% 0.69/1.07
% 0.69/1.07 ============================== STATISTICS ============================
% 0.69/1.07
% 0.69/1.07 Given=17. Generated=995. Kept=184. proofs=1.
% 0.69/1.07 Usable=16. Sos=131. Demods=148. Limbo=3, Disabled=35. Hints=0.
% 0.69/1.07 Megabytes=0.67.
% 0.69/1.07 User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.69/1.07
% 0.69/1.07 ============================== end of statistics =====================
% 0.69/1.07
% 0.69/1.07 ============================== end of search =========================
% 0.69/1.07
% 0.69/1.07 THEOREM PROVED
% 0.69/1.07 % SZS status Unsatisfiable
% 0.69/1.07
% 0.69/1.07 Exiting with 1 proof.
% 0.69/1.07
% 0.69/1.07 Process 32142 exit (max_proofs) Wed Jun 1 20:24:39 2022
% 0.69/1.07 Prover9 interrupted
%------------------------------------------------------------------------------