TSTP Solution File: PLA004-2 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n026.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:21 EDT 2022

% Result   : Unsatisfiable 5.14s 5.46s
% Output   : Refutation 5.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : PLA004-2 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n026.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:46:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 5.14/5.46  ============================== Prover9 ===============================
% 5.14/5.46  Prover9 (32) version 2009-11A, November 2009.
% 5.14/5.46  Process 7171 was started by sandbox on n026.cluster.edu,
% 5.14/5.46  Tue May 31 22:46:27 2022
% 5.14/5.46  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7017_n026.cluster.edu".
% 5.14/5.46  ============================== end of head ===========================
% 5.14/5.46  
% 5.14/5.46  ============================== INPUT =================================
% 5.14/5.46  
% 5.14/5.46  % Reading from file /tmp/Prover9_7017_n026.cluster.edu
% 5.14/5.46  
% 5.14/5.46  set(prolog_style_variables).
% 5.14/5.46  set(auto2).
% 5.14/5.46      % set(auto2) -> set(auto).
% 5.14/5.46      % set(auto) -> set(auto_inference).
% 5.14/5.46      % set(auto) -> set(auto_setup).
% 5.14/5.46      % set(auto_setup) -> set(predicate_elim).
% 5.14/5.46      % set(auto_setup) -> assign(eq_defs, unfold).
% 5.14/5.46      % set(auto) -> set(auto_limits).
% 5.14/5.46      % set(auto_limits) -> assign(max_weight, "100.000").
% 5.14/5.46      % set(auto_limits) -> assign(sos_limit, 20000).
% 5.14/5.46      % set(auto) -> set(auto_denials).
% 5.14/5.46      % set(auto) -> set(auto_process).
% 5.14/5.46      % set(auto2) -> assign(new_constants, 1).
% 5.14/5.46      % set(auto2) -> assign(fold_denial_max, 3).
% 5.14/5.46      % set(auto2) -> assign(max_weight, "200.000").
% 5.14/5.46      % set(auto2) -> assign(max_hours, 1).
% 5.14/5.46      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.14/5.46      % set(auto2) -> assign(max_seconds, 0).
% 5.14/5.46      % set(auto2) -> assign(max_minutes, 5).
% 5.14/5.46      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.14/5.46      % set(auto2) -> set(sort_initial_sos).
% 5.14/5.46      % set(auto2) -> assign(sos_limit, -1).
% 5.14/5.46      % set(auto2) -> assign(lrs_ticks, 3000).
% 5.14/5.46      % set(auto2) -> assign(max_megs, 400).
% 5.14/5.46      % set(auto2) -> assign(stats, some).
% 5.14/5.46      % set(auto2) -> clear(echo_input).
% 5.14/5.46      % set(auto2) -> set(quiet).
% 5.14/5.46      % set(auto2) -> clear(print_initial_clauses).
% 5.14/5.46      % set(auto2) -> clear(print_given).
% 5.14/5.46  assign(lrs_ticks,-1).
% 5.14/5.46  assign(sos_limit,10000).
% 5.14/5.46  assign(order,kbo).
% 5.14/5.46  set(lex_order_vars).
% 5.14/5.46  clear(print_given).
% 5.14/5.46  
% 5.14/5.46  % formulas(sos).  % not echoed (31 formulas)
% 5.14/5.46  
% 5.14/5.46  ============================== end of input ==========================
% 5.14/5.46  
% 5.14/5.46  % From the command line: assign(max_seconds, 300).
% 5.14/5.46  
% 5.14/5.46  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.14/5.46  
% 5.14/5.46  % Formulas that are not ordinary clauses:
% 5.14/5.46  
% 5.14/5.46  ============================== end of process non-clausal formulas ===
% 5.14/5.46  
% 5.14/5.46  ============================== PROCESS INITIAL CLAUSES ===============
% 5.14/5.46  
% 5.14/5.46  ============================== PREDICATE ELIMINATION =================
% 5.14/5.46  
% 5.14/5.46  ============================== end predicate elimination =============
% 5.14/5.46  
% 5.14/5.46  Auto_denials:
% 5.14/5.46    % copying label prove_CBA to answer in negative clause
% 5.14/5.46  
% 5.14/5.46  Term ordering decisions:
% 5.14/5.46  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.14/5.46  
% 5.14/5.46  ============================== end of process initial clauses ========
% 5.14/5.46  
% 5.14/5.46  ============================== CLAUSES FOR SEARCH ====================
% 5.14/5.46  
% 5.14/5.46  ============================== end of clauses for search =============
% 5.14/5.46  
% 5.14/5.46  ============================== SEARCH ================================
% 5.14/5.46  
% 5.14/5.46  % Starting search at 0.01 seconds.
% 5.14/5.46  
% 5.14/5.46  Low Water (keep): wt=15.000, iters=3506
% 5.14/5.46  
% 5.14/5.46  Low Water (keep): wt=14.000, iters=3358
% 5.14/5.46  
% 5.14/5.46  Low Water (keep): wt=13.000, iters=3339
% 5.14/5.46  
% 5.14/5.46  Low Water (keep): wt=12.000, iters=3350
% 5.14/5.46  
% 5.14/5.46  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 36 (0.00 of 0.26 sec).
% 5.14/5.46  
% 5.14/5.46  ============================== PROOF =================================
% 5.14/5.46  % SZS status Unsatisfiable
% 5.14/5.46  % SZS output start Refutation
% 5.14/5.46  
% 5.14/5.46  % Proof 1 at 3.76 (+ 0.70) seconds: prove_CBA.
% 5.14/5.46  % Length of proof is 39.
% 5.14/5.46  % Level of proof is 10.
% 5.14/5.46  % Maximum clause weight is 22.000.
% 5.14/5.46  % Given clauses 2631.
% 5.14/5.46  
% 5.14/5.46  1 differ(a,b) # label(differ_a_b) # label(axiom).  [assumption].
% 5.14/5.46  2 differ(a,c) # label(differ_a_c) # label(axiom).  [assumption].
% 5.14/5.46  5 differ(b,c) # label(differ_b_c) # label(axiom).  [assumption].
% 5.14/5.46  7 differ(b,table) # label(differ_b_table) # label(axiom).  [assumption].
% 5.14/5.46  9 differ(c,table) # label(differ_c_table) # label(axiom).  [assumption].
% 5.14/5.46  11 holds(empty,s0) # label(initial_state8) # label(axiom).  [assumption].
% 5.14/5.46  12 holds(clear(a),s0) # label(initial_state5) # label(axiom).  [assumption].
% 5.14/5.46  13 holds(clear(b),s0) # label(initial_state6) # label(axiom).  [assumption].
% 5.14/5.46  14 holds(clear(c),s0) # label(initial_state7) # label(axiom).  [assumption].
% 5.14/5.46  20 -holds(and(on(b,a),on(c,b)),A) # label(prove_CBA) # label(negated_conjecture) # answer(prove_CBA).  [assumption].
% 5.14/5.46  21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom).  [assumption].
% 5.14/5.46  22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom).  [assumption].
% 5.14/5.46  23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom).  [assumption].
% 5.14/5.46  24 holds(on(A,B),do(putdown(C,D),E)) | -holds(on(A,B),E) # label(putdown_4) # label(axiom).  [assumption].
% 5.14/5.46  25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom).  [assumption].
% 5.14/5.46  26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom).  [assumption].
% 5.14/5.46  27 holds(on(A,B),do(pickup(C),D)) | -holds(on(A,B),D) | -differ(A,C) # label(pickup_3) # label(axiom).  [assumption].
% 5.14/5.46  28 holds(clear(A),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_3) # label(axiom).  [assumption].
% 5.14/5.46  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.14/5.46  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.14/5.46  37 differ(c,b).  [ur(21,b,5,a)].
% 5.14/5.46  40 differ(c,a).  [ur(21,b,2,a)].
% 5.14/5.46  42 -holds(on(b,a),A) | -holds(on(c,b),A) # answer(prove_CBA).  [resolve(22,a,20,a)].
% 5.14/5.46  132 holds(clear(a),do(pickup(b),s0)).  [ur(23,b,12,a,c,1,a)].
% 5.14/5.46  157 holds(holding(b),do(pickup(b),s0)).  [ur(29,b,11,a,c,13,a,d,7,a)].
% 5.14/5.46  162 -holds(on(c,b),do(putdown(A,B),C)) | -holds(on(b,a),C) # answer(prove_CBA).  [resolve(42,a,24,a)].
% 5.14/5.46  166 -holds(on(b,a),A) | -holds(holding(c),A) | -holds(clear(b),A) # answer(prove_CBA).  [resolve(162,a,30,a)].
% 5.14/5.46  171 -holds(holding(c),do(pickup(A),B)) | -holds(clear(b),do(pickup(A),B)) | -holds(on(b,a),B) | -differ(b,A) # answer(prove_CBA).  [resolve(166,a,27,a)].
% 5.14/5.46  183 holds(clear(c),do(pickup(b),s0)).  [ur(23,b,14,a,c,37,a)].
% 5.14/5.46  3247 holds(on(b,a),do(putdown(b,a),do(pickup(b),s0))).  [ur(30,b,157,a,c,132,a)].
% 5.14/5.46  3249 holds(clear(b),do(putdown(b,a),do(pickup(b),s0))).  [ur(28,b,157,a,c,132,a)].
% 5.14/5.46  3251 holds(empty,do(putdown(b,a),do(pickup(b),s0))).  [ur(25,b,157,a,c,132,a)].
% 5.14/5.46  3405 holds(clear(c),do(putdown(A,a),do(pickup(b),s0))).  [ur(26,b,183,a,c,40,a)].
% 5.14/5.46  5549 -holds(holding(c),do(pickup(A),B)) | -holds(on(b,a),B) | -differ(b,A) | -holds(clear(b),B) # answer(prove_CBA).  [resolve(171,b,23,a),merge(e)].
% 5.14/5.46  5740 -holds(holding(c),do(pickup(c),A)) | -holds(on(b,a),A) | -holds(clear(b),A) # answer(prove_CBA).  [resolve(5549,c,5,a)].
% 5.14/5.46  5869 -holds(on(b,a),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(c),A) | -differ(c,table) # answer(prove_CBA).  [resolve(5740,a,29,a)].
% 5.14/5.46  6077 -holds(on(b,a),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(c),A) # answer(prove_CBA).  [resolve(5869,e,9,a)].
% 5.14/5.46  11787 -holds(on(b,a),do(putdown(b,a),do(pickup(b),s0))) # answer(prove_CBA).  [ur(6077,b,3249,a,c,3251,a,d,3405,a)].
% 5.14/5.46  11788 $F # answer(prove_CBA).  [resolve(11787,a,3247,a)].
% 5.14/5.46  
% 5.14/5.46  % SZS output end Refutation
% 5.14/5.46  ============================== end of proof ==========================
% 5.14/5.46  
% 5.14/5.46  ============================== STATISTICS ============================
% 5.14/5.46  
% 5.14/5.46  Given=2631. Generated=1394295. Kept=11787. proofs=1.
% 5.14/5.46  Usable=2617. Sos=8985. Demods=0. Limbo=1, Disabled=214. Hints=0.
% 5.14/5.46  Megabytes=11.51.
% 5.14/5.46  User_CPU=3.76, System_CPU=0.70, Wall_clock=4.
% 5.14/5.46  
% 5.14/5.46  ============================== end of statistics =====================
% 5.14/5.46  
% 5.14/5.46  ============================== end of search =========================
% 5.14/5.46  
% 5.14/5.46  THEOREM PROVED
% 5.14/5.46  % SZS status Unsatisfiable
% 5.14/5.46  
% 5.14/5.46  Exiting with 1 proof.
% 5.14/5.46  
% 5.14/5.46  Process 7171 exit (max_proofs) Tue May 31 22:46:31 2022
% 5.14/5.46  Prover9 interrupted
%------------------------------------------------------------------------------