TSTP Solution File: PLA011-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : PLA011-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n024.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 : Mon Jul 18 17:31:22 EDT 2022

% Result   : Unsatisfiable 5.21s 5.53s
% Output   : Refutation 5.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PLA011-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n024.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 : Tue May 31 22:15:51 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 5.21/5.53  ============================== Prover9 ===============================
% 5.21/5.53  Prover9 (32) version 2009-11A, November 2009.
% 5.21/5.53  Process 1709 was started by sandbox2 on n024.cluster.edu,
% 5.21/5.53  Tue May 31 22:15:51 2022
% 5.21/5.53  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1551_n024.cluster.edu".
% 5.21/5.53  ============================== end of head ===========================
% 5.21/5.53  
% 5.21/5.53  ============================== INPUT =================================
% 5.21/5.53  
% 5.21/5.53  % Reading from file /tmp/Prover9_1551_n024.cluster.edu
% 5.21/5.53  
% 5.21/5.53  set(prolog_style_variables).
% 5.21/5.53  set(auto2).
% 5.21/5.53      % set(auto2) -> set(auto).
% 5.21/5.53      % set(auto) -> set(auto_inference).
% 5.21/5.53      % set(auto) -> set(auto_setup).
% 5.21/5.53      % set(auto_setup) -> set(predicate_elim).
% 5.21/5.53      % set(auto_setup) -> assign(eq_defs, unfold).
% 5.21/5.53      % set(auto) -> set(auto_limits).
% 5.21/5.53      % set(auto_limits) -> assign(max_weight, "100.000").
% 5.21/5.53      % set(auto_limits) -> assign(sos_limit, 20000).
% 5.21/5.53      % set(auto) -> set(auto_denials).
% 5.21/5.53      % set(auto) -> set(auto_process).
% 5.21/5.53      % set(auto2) -> assign(new_constants, 1).
% 5.21/5.53      % set(auto2) -> assign(fold_denial_max, 3).
% 5.21/5.53      % set(auto2) -> assign(max_weight, "200.000").
% 5.21/5.53      % set(auto2) -> assign(max_hours, 1).
% 5.21/5.53      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.21/5.53      % set(auto2) -> assign(max_seconds, 0).
% 5.21/5.53      % set(auto2) -> assign(max_minutes, 5).
% 5.21/5.53      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.21/5.53      % set(auto2) -> set(sort_initial_sos).
% 5.21/5.53      % set(auto2) -> assign(sos_limit, -1).
% 5.21/5.53      % set(auto2) -> assign(lrs_ticks, 3000).
% 5.21/5.53      % set(auto2) -> assign(max_megs, 400).
% 5.21/5.53      % set(auto2) -> assign(stats, some).
% 5.21/5.53      % set(auto2) -> clear(echo_input).
% 5.21/5.53      % set(auto2) -> set(quiet).
% 5.21/5.53      % set(auto2) -> clear(print_initial_clauses).
% 5.21/5.53      % set(auto2) -> clear(print_given).
% 5.21/5.53  assign(lrs_ticks,-1).
% 5.21/5.53  assign(sos_limit,10000).
% 5.21/5.53  assign(order,kbo).
% 5.21/5.53  set(lex_order_vars).
% 5.21/5.53  clear(print_given).
% 5.21/5.53  
% 5.21/5.53  % formulas(sos).  % not echoed (31 formulas)
% 5.21/5.53  
% 5.21/5.53  ============================== end of input ==========================
% 5.21/5.53  
% 5.21/5.53  % From the command line: assign(max_seconds, 300).
% 5.21/5.53  
% 5.21/5.53  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.21/5.53  
% 5.21/5.53  % Formulas that are not ordinary clauses:
% 5.21/5.53  
% 5.21/5.53  ============================== end of process non-clausal formulas ===
% 5.21/5.53  
% 5.21/5.53  ============================== PROCESS INITIAL CLAUSES ===============
% 5.21/5.53  
% 5.21/5.53  ============================== PREDICATE ELIMINATION =================
% 5.21/5.53  
% 5.21/5.53  ============================== end predicate elimination =============
% 5.21/5.53  
% 5.21/5.53  Auto_denials:
% 5.21/5.53    % copying label prove_DCB to answer in negative clause
% 5.21/5.53  
% 5.21/5.53  Term ordering decisions:
% 5.21/5.53  Function symbol KB weights:  table=1. s0=1. a=1. b=1. c=1. d=1. empty=1. on=1. do=1. putdown=1. and=1. clear=1. holding=1. pickup=1.
% 5.21/5.53  
% 5.21/5.53  ============================== end of process initial clauses ========
% 5.21/5.53  
% 5.21/5.53  ============================== CLAUSES FOR SEARCH ====================
% 5.21/5.53  
% 5.21/5.53  ============================== end of clauses for search =============
% 5.21/5.53  
% 5.21/5.53  ============================== SEARCH ================================
% 5.21/5.53  
% 5.21/5.53  % Starting search at 0.01 seconds.
% 5.21/5.53  
% 5.21/5.53  Low Water (keep): wt=15.000, iters=3506
% 5.21/5.53  
% 5.21/5.53  Low Water (keep): wt=14.000, iters=3358
% 5.21/5.53  
% 5.21/5.53  Low Water (keep): wt=13.000, iters=3339
% 5.21/5.53  
% 5.21/5.53  Low Water (keep): wt=12.000, iters=3350
% 5.21/5.53  
% 5.21/5.53  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 0.35 sec).
% 5.21/5.53  
% 5.21/5.53  ============================== PROOF =================================
% 5.21/5.53  % SZS status Unsatisfiable
% 5.21/5.53  % SZS output start Refutation
% 5.21/5.53  
% 5.21/5.53  % Proof 1 at 3.84 (+ 0.71) seconds: prove_DCB.
% 5.21/5.53  % Length of proof is 39.
% 5.21/5.53  % Level of proof is 10.
% 5.21/5.53  % Maximum clause weight is 22.000.
% 5.21/5.53  % Given clauses 2622.
% 5.21/5.53  
% 5.21/5.53  5 differ(b,c) # label(differ_b_c) # label(axiom).  [assumption].
% 5.21/5.53  6 differ(b,d) # label(differ_b_d) # label(axiom).  [assumption].
% 5.21/5.53  8 differ(c,d) # label(differ_c_d) # label(axiom).  [assumption].
% 5.21/5.53  9 differ(c,table) # label(differ_c_table) # label(axiom).  [assumption].
% 5.21/5.53  10 differ(d,table) # label(differ_d_table) # label(axiom).  [assumption].
% 5.21/5.53  11 holds(empty,s0) # label(initial_state8) # label(axiom).  [assumption].
% 5.21/5.53  13 holds(clear(b),s0) # label(initial_state6) # label(axiom).  [assumption].
% 5.21/5.53  14 holds(clear(c),s0) # label(initial_state7) # label(axiom).  [assumption].
% 5.21/5.53  18 holds(on(c,d),s0) # label(initial_state3) # label(axiom).  [assumption].
% 5.21/5.53  20 -holds(and(on(d,c),on(c,b)),A) # label(prove_DCB) # label(negated_conjecture) # answer(prove_DCB).  [assumption].
% 5.21/5.53  21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom).  [assumption].
% 5.21/5.53  22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom).  [assumption].
% 5.21/5.53  23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom).  [assumption].
% 5.21/5.53  24 holds(on(A,B),do(putdown(C,D),E)) | -holds(on(A,B),E) # label(putdown_4) # label(axiom).  [assumption].
% 5.21/5.53  25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom).  [assumption].
% 5.21/5.53  26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom).  [assumption].
% 5.21/5.53  27 holds(on(A,B),do(pickup(C),D)) | -holds(on(A,B),D) | -differ(A,C) # label(pickup_3) # label(axiom).  [assumption].
% 5.21/5.53  28 holds(clear(A),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_3) # label(axiom).  [assumption].
% 5.21/5.53  29 holds(holding(A),do(pickup(A),B)) | -holds(empty,B) | -holds(clear(A),B) | -differ(A,table) # label(pickup_1) # label(axiom).  [assumption].
% 5.21/5.53  30 holds(on(A,B),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_2) # label(axiom).  [assumption].
% 5.21/5.53  31 holds(clear(A),do(pickup(B),C)) | -holds(on(B,A),C) | -holds(clear(B),C) | -holds(empty,C) # label(pickup_2) # label(axiom).  [assumption].
% 5.21/5.53  36 differ(d,b).  [ur(21,b,6,a)].
% 5.21/5.53  42 -holds(on(d,c),A) | -holds(on(c,b),A) # answer(prove_DCB).  [resolve(22,a,20,a)].
% 5.21/5.53  128 holds(clear(b),do(pickup(c),s0)).  [ur(23,b,13,a,c,5,a)].
% 5.21/5.53  156 holds(holding(c),do(pickup(c),s0)).  [ur(29,b,11,a,c,14,a,d,9,a)].
% 5.21/5.53  159 holds(clear(d),do(pickup(c),s0)).  [ur(31,b,18,a,c,14,a,d,11,a)].
% 5.21/5.53  165 -holds(on(d,c),do(putdown(A,B),C)) | -holds(on(c,b),C) # answer(prove_DCB).  [resolve(42,b,24,a)].
% 5.21/5.53  184 -holds(on(c,b),A) | -holds(holding(d),A) | -holds(clear(c),A) # answer(prove_DCB).  [resolve(165,a,30,a)].
% 5.21/5.53  189 -holds(holding(d),do(pickup(A),B)) | -holds(clear(c),do(pickup(A),B)) | -holds(on(c,b),B) | -differ(c,A) # answer(prove_DCB).  [resolve(184,a,27,a)].
% 5.21/5.53  3224 holds(on(c,b),do(putdown(c,b),do(pickup(c),s0))).  [ur(30,b,156,a,c,128,a)].
% 5.21/5.53  3227 holds(clear(c),do(putdown(c,b),do(pickup(c),s0))).  [ur(28,b,156,a,c,128,a)].
% 5.21/5.53  3230 holds(empty,do(putdown(c,b),do(pickup(c),s0))).  [ur(25,b,156,a,c,128,a)].
% 5.21/5.53  3376 holds(clear(d),do(putdown(A,b),do(pickup(c),s0))).  [ur(26,b,159,a,c,36,a)].
% 5.21/5.53  6165 -holds(holding(d),do(pickup(A),B)) | -holds(on(c,b),B) | -differ(c,A) | -holds(clear(c),B) # answer(prove_DCB).  [resolve(189,b,23,a),merge(e)].
% 5.21/5.53  6371 -holds(holding(d),do(pickup(d),A)) | -holds(on(c,b),A) | -holds(clear(c),A) # answer(prove_DCB).  [resolve(6165,c,8,a)].
% 5.21/5.53  6464 -holds(on(c,b),A) | -holds(clear(c),A) | -holds(empty,A) | -holds(clear(d),A) | -differ(d,table) # answer(prove_DCB).  [resolve(6371,a,29,a)].
% 5.21/5.53  6761 -holds(on(c,b),A) | -holds(clear(c),A) | -holds(empty,A) | -holds(clear(d),A) # answer(prove_DCB).  [resolve(6464,e,10,a)].
% 5.21/5.53  11522 -holds(on(c,b),do(putdown(c,b),do(pickup(c),s0))) # answer(prove_DCB).  [ur(6761,b,3227,a,c,3230,a,d,3376,a)].
% 5.21/5.53  11523 $F # answer(prove_DCB).  [resolve(11522,a,3224,a)].
% 5.21/5.53  
% 5.21/5.53  % SZS output end Refutation
% 5.21/5.53  ============================== end of proof ==========================
% 5.21/5.53  
% 5.21/5.53  ============================== STATISTICS ============================
% 5.21/5.53  
% 5.21/5.53  Given=2622. Generated=1381162. Kept=11522. proofs=1.
% 5.21/5.53  Usable=2599. Sos=8771. Demods=0. Limbo=1, Disabled=181. Hints=0.
% 5.21/5.53  Megabytes=11.10.
% 5.21/5.53  User_CPU=3.84, System_CPU=0.71, Wall_clock=5.
% 5.21/5.53  
% 5.21/5.53  ============================== end of statistics =====================
% 5.21/5.53  
% 5.21/5.53  ============================== end of search =========================
% 5.21/5.53  
% 5.21/5.53  THEOREM PROVED
% 5.21/5.53  % SZS status Unsatisfiable
% 5.21/5.53  
% 5.21/5.53  Exiting with 1 proof.
% 5.21/5.53  
% 5.21/5.53  Process 1709 exit (max_proofs) Tue May 31 22:15:56 2022
% 5.21/5.53  Prover9 interrupted
%------------------------------------------------------------------------------