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

View Problem - Process Solution

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

% Computer : n027.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:24 EDT 2022

% Result   : Unsatisfiable 0.81s 1.14s
% Output   : Refutation 0.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : PLA022-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue May 31 23:41:03 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.81/1.14  ============================== Prover9 ===============================
% 0.81/1.14  Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.14  Process 7936 was started by sandbox on n027.cluster.edu,
% 0.81/1.14  Tue May 31 23:41:03 2022
% 0.81/1.14  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7783_n027.cluster.edu".
% 0.81/1.14  ============================== end of head ===========================
% 0.81/1.14  
% 0.81/1.14  ============================== INPUT =================================
% 0.81/1.14  
% 0.81/1.14  % Reading from file /tmp/Prover9_7783_n027.cluster.edu
% 0.81/1.14  
% 0.81/1.14  set(prolog_style_variables).
% 0.81/1.14  set(auto2).
% 0.81/1.14      % set(auto2) -> set(auto).
% 0.81/1.14      % set(auto) -> set(auto_inference).
% 0.81/1.14      % set(auto) -> set(auto_setup).
% 0.81/1.14      % set(auto_setup) -> set(predicate_elim).
% 0.81/1.14      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.14      % set(auto) -> set(auto_limits).
% 0.81/1.14      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.14      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.14      % set(auto) -> set(auto_denials).
% 0.81/1.14      % set(auto) -> set(auto_process).
% 0.81/1.14      % set(auto2) -> assign(new_constants, 1).
% 0.81/1.14      % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.14      % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.14      % set(auto2) -> assign(max_hours, 1).
% 0.81/1.14      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.14      % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.14      % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.14      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.14      % set(auto2) -> set(sort_initial_sos).
% 0.81/1.14      % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.14      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.14      % set(auto2) -> assign(max_megs, 400).
% 0.81/1.14      % set(auto2) -> assign(stats, some).
% 0.81/1.14      % set(auto2) -> clear(echo_input).
% 0.81/1.14      % set(auto2) -> set(quiet).
% 0.81/1.14      % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.14      % set(auto2) -> clear(print_given).
% 0.81/1.14  assign(lrs_ticks,-1).
% 0.81/1.14  assign(sos_limit,10000).
% 0.81/1.14  assign(order,kbo).
% 0.81/1.14  set(lex_order_vars).
% 0.81/1.14  clear(print_given).
% 0.81/1.14  
% 0.81/1.14  % formulas(sos).  % not echoed (31 formulas)
% 0.81/1.14  
% 0.81/1.14  ============================== end of input ==========================
% 0.81/1.14  
% 0.81/1.14  % From the command line: assign(max_seconds, 300).
% 0.81/1.14  
% 0.81/1.14  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.14  
% 0.81/1.14  % Formulas that are not ordinary clauses:
% 0.81/1.14  
% 0.81/1.14  ============================== end of process non-clausal formulas ===
% 0.81/1.14  
% 0.81/1.14  ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.14  
% 0.81/1.14  ============================== PREDICATE ELIMINATION =================
% 0.81/1.14  
% 0.81/1.14  ============================== end predicate elimination =============
% 0.81/1.14  
% 0.81/1.14  Auto_denials:
% 0.81/1.14    % copying label prove_ACD to answer in negative clause
% 0.81/1.14  
% 0.81/1.14  Term ordering decisions:
% 0.81/1.14  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.
% 0.81/1.14  
% 0.81/1.14  ============================== end of process initial clauses ========
% 0.81/1.14  
% 0.81/1.14  ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.14  
% 0.81/1.14  ============================== end of clauses for search =============
% 0.81/1.14  
% 0.81/1.14  ============================== SEARCH ================================
% 0.81/1.14  
% 0.81/1.14  % Starting search at 0.01 seconds.
% 0.81/1.14  
% 0.81/1.14  ============================== PROOF =================================
% 0.81/1.14  % SZS status Unsatisfiable
% 0.81/1.14  % SZS output start Refutation
% 0.81/1.14  
% 0.81/1.14  % Proof 1 at 0.14 (+ 0.01) seconds: prove_ACD.
% 0.81/1.14  % Length of proof is 23.
% 0.81/1.14  % Level of proof is 5.
% 0.81/1.14  % Maximum clause weight is 17.000.
% 0.81/1.14  % Given clauses 157.
% 0.81/1.14  
% 0.81/1.14  2 differ(a,c) # label(differ_a_c) # label(axiom).  [assumption].
% 0.81/1.14  4 differ(a,table) # label(differ_a_table) # label(axiom).  [assumption].
% 0.81/1.14  11 holds(empty,s0) # label(initial_state8) # label(axiom).  [assumption].
% 0.81/1.14  12 holds(clear(a),s0) # label(initial_state5) # label(axiom).  [assumption].
% 0.81/1.14  14 holds(clear(c),s0) # label(initial_state7) # label(axiom).  [assumption].
% 0.81/1.14  18 holds(on(c,d),s0) # label(initial_state3) # label(axiom).  [assumption].
% 0.81/1.14  20 -holds(and(on(c,d),on(a,c)),A) # label(prove_ACD) # label(negated_conjecture) # answer(prove_ACD).  [assumption].
% 0.81/1.14  21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom).  [assumption].
% 0.81/1.14  22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom).  [assumption].
% 0.81/1.14  23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom).  [assumption].
% 0.81/1.14  24 holds(on(A,B),do(putdown(C,D),E)) | -holds(on(A,B),E) # label(putdown_4) # label(axiom).  [assumption].
% 0.81/1.14  27 holds(on(A,B),do(pickup(C),D)) | -holds(on(A,B),D) | -differ(A,C) # label(pickup_3) # label(axiom).  [assumption].
% 0.81/1.14  29 holds(holding(A),do(pickup(A),B)) | -holds(empty,B) | -holds(clear(A),B) | -differ(A,table) # label(pickup_1) # label(axiom).  [assumption].
% 0.81/1.14  30 holds(on(A,B),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_2) # label(axiom).  [assumption].
% 0.81/1.14  40 differ(c,a).  [ur(21,b,2,a)].
% 0.81/1.14  42 -holds(on(c,d),A) | -holds(on(a,c),A) # answer(prove_ACD).  [resolve(22,a,20,a)].
% 0.81/1.14  159 holds(holding(a),do(pickup(a),s0)).  [ur(29,b,11,a,c,12,a,d,4,a)].
% 0.81/1.14  163 -holds(on(a,c),do(putdown(A,B),C)) | -holds(on(c,d),C) # answer(prove_ACD).  [resolve(42,a,24,a)].
% 0.81/1.14  167 -holds(on(c,d),A) | -holds(holding(a),A) | -holds(clear(c),A) # answer(prove_ACD).  [resolve(163,a,30,a)].
% 0.81/1.14  200 holds(on(c,d),do(pickup(a),s0)).  [ur(27,b,18,a,c,40,a)].
% 0.81/1.14  202 holds(clear(c),do(pickup(a),s0)).  [ur(23,b,14,a,c,40,a)].
% 0.81/1.14  3405 -holds(on(c,d),do(pickup(a),s0)) # answer(prove_ACD).  [ur(167,b,159,a,c,202,a)].
% 0.81/1.14  3406 $F # answer(prove_ACD).  [resolve(3405,a,200,a)].
% 0.81/1.14  
% 0.81/1.14  % SZS output end Refutation
% 0.81/1.14  ============================== end of proof ==========================
% 0.81/1.14  
% 0.81/1.14  ============================== STATISTICS ============================
% 0.81/1.14  
% 0.81/1.14  Given=157. Generated=3600. Kept=3405. proofs=1.
% 0.81/1.14  Usable=152. Sos=3209. Demods=0. Limbo=20, Disabled=54. Hints=0.
% 0.81/1.14  Megabytes=2.33.
% 0.81/1.14  User_CPU=0.14, System_CPU=0.01, Wall_clock=0.
% 0.81/1.14  
% 0.81/1.14  ============================== end of statistics =====================
% 0.81/1.14  
% 0.81/1.14  ============================== end of search =========================
% 0.81/1.14  
% 0.81/1.14  THEOREM PROVED
% 0.81/1.14  % SZS status Unsatisfiable
% 0.81/1.14  
% 0.81/1.14  Exiting with 1 proof.
% 0.81/1.14  
% 0.81/1.14  Process 7936 exit (max_proofs) Tue May 31 23:41:03 2022
% 0.81/1.14  Prover9 interrupted
%------------------------------------------------------------------------------