TSTP Solution File: PLA005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA005-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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.19s 5.51s
% Output : Refutation 5.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA005-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 : Tue May 31 23:10:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 5.19/5.51 ============================== Prover9 ===============================
% 5.19/5.51 Prover9 (32) version 2009-11A, November 2009.
% 5.19/5.51 Process 16396 was started by sandbox2 on n017.cluster.edu,
% 5.19/5.51 Tue May 31 23:10:42 2022
% 5.19/5.51 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16243_n017.cluster.edu".
% 5.19/5.51 ============================== end of head ===========================
% 5.19/5.51
% 5.19/5.51 ============================== INPUT =================================
% 5.19/5.51
% 5.19/5.51 % Reading from file /tmp/Prover9_16243_n017.cluster.edu
% 5.19/5.51
% 5.19/5.51 set(prolog_style_variables).
% 5.19/5.51 set(auto2).
% 5.19/5.51 % set(auto2) -> set(auto).
% 5.19/5.51 % set(auto) -> set(auto_inference).
% 5.19/5.51 % set(auto) -> set(auto_setup).
% 5.19/5.51 % set(auto_setup) -> set(predicate_elim).
% 5.19/5.51 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.19/5.51 % set(auto) -> set(auto_limits).
% 5.19/5.51 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.19/5.51 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.19/5.51 % set(auto) -> set(auto_denials).
% 5.19/5.51 % set(auto) -> set(auto_process).
% 5.19/5.51 % set(auto2) -> assign(new_constants, 1).
% 5.19/5.51 % set(auto2) -> assign(fold_denial_max, 3).
% 5.19/5.51 % set(auto2) -> assign(max_weight, "200.000").
% 5.19/5.51 % set(auto2) -> assign(max_hours, 1).
% 5.19/5.51 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.19/5.51 % set(auto2) -> assign(max_seconds, 0).
% 5.19/5.51 % set(auto2) -> assign(max_minutes, 5).
% 5.19/5.51 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.19/5.51 % set(auto2) -> set(sort_initial_sos).
% 5.19/5.51 % set(auto2) -> assign(sos_limit, -1).
% 5.19/5.51 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.19/5.51 % set(auto2) -> assign(max_megs, 400).
% 5.19/5.51 % set(auto2) -> assign(stats, some).
% 5.19/5.51 % set(auto2) -> clear(echo_input).
% 5.19/5.51 % set(auto2) -> set(quiet).
% 5.19/5.51 % set(auto2) -> clear(print_initial_clauses).
% 5.19/5.51 % set(auto2) -> clear(print_given).
% 5.19/5.51 assign(lrs_ticks,-1).
% 5.19/5.51 assign(sos_limit,10000).
% 5.19/5.51 assign(order,kbo).
% 5.19/5.51 set(lex_order_vars).
% 5.19/5.51 clear(print_given).
% 5.19/5.51
% 5.19/5.51 % formulas(sos). % not echoed (31 formulas)
% 5.19/5.51
% 5.19/5.51 ============================== end of input ==========================
% 5.19/5.51
% 5.19/5.51 % From the command line: assign(max_seconds, 300).
% 5.19/5.51
% 5.19/5.51 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.19/5.51
% 5.19/5.51 % Formulas that are not ordinary clauses:
% 5.19/5.51
% 5.19/5.51 ============================== end of process non-clausal formulas ===
% 5.19/5.51
% 5.19/5.51 ============================== PROCESS INITIAL CLAUSES ===============
% 5.19/5.51
% 5.19/5.51 ============================== PREDICATE ELIMINATION =================
% 5.19/5.51
% 5.19/5.51 ============================== end predicate elimination =============
% 5.19/5.51
% 5.19/5.51 Auto_denials:
% 5.19/5.51 % copying label prove_CA_DB to answer in negative clause
% 5.19/5.51
% 5.19/5.51 Term ordering decisions:
% 5.19/5.51 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.19/5.51
% 5.19/5.51 ============================== end of process initial clauses ========
% 5.19/5.51
% 5.19/5.51 ============================== CLAUSES FOR SEARCH ====================
% 5.19/5.51
% 5.19/5.51 ============================== end of clauses for search =============
% 5.19/5.51
% 5.19/5.51 ============================== SEARCH ================================
% 5.19/5.51
% 5.19/5.51 % Starting search at 0.01 seconds.
% 5.19/5.51
% 5.19/5.51 Low Water (keep): wt=15.000, iters=3506
% 5.19/5.51
% 5.19/5.51 Low Water (keep): wt=14.000, iters=3358
% 5.19/5.51
% 5.19/5.51 Low Water (keep): wt=13.000, iters=3339
% 5.19/5.51
% 5.19/5.51 Low Water (keep): wt=12.000, iters=3350
% 5.19/5.51
% 5.19/5.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 0.34 sec).
% 5.19/5.51
% 5.19/5.51 ============================== PROOF =================================
% 5.19/5.51 % SZS status Unsatisfiable
% 5.19/5.51 % SZS output start Refutation
% 5.19/5.51
% 5.19/5.51 % Proof 1 at 3.84 (+ 0.72) seconds: prove_CA_DB.
% 5.19/5.51 % Length of proof is 45.
% 5.19/5.51 % Level of proof is 11.
% 5.19/5.51 % Maximum clause weight is 20.000.
% 5.19/5.51 % Given clauses 2621.
% 5.19/5.51
% 5.19/5.51 1 differ(a,b) # label(differ_a_b) # label(axiom). [assumption].
% 5.19/5.51 2 differ(a,c) # label(differ_a_c) # label(axiom). [assumption].
% 5.19/5.51 3 differ(a,d) # label(differ_a_d) # label(axiom). [assumption].
% 5.19/5.51 5 differ(b,c) # label(differ_b_c) # label(axiom). [assumption].
% 5.19/5.51 6 differ(b,d) # label(differ_b_d) # label(axiom). [assumption].
% 5.19/5.51 8 differ(c,d) # label(differ_c_d) # label(axiom). [assumption].
% 5.19/5.51 9 differ(c,table) # label(differ_c_table) # label(axiom). [assumption].
% 5.19/5.51 10 differ(d,table) # label(differ_d_table) # label(axiom). [assumption].
% 5.19/5.51 11 holds(empty,s0) # label(initial_state8) # label(axiom). [assumption].
% 5.19/5.51 12 holds(clear(a),s0) # label(initial_state5) # label(axiom). [assumption].
% 5.19/5.51 13 holds(clear(b),s0) # label(initial_state6) # label(axiom). [assumption].
% 5.19/5.51 14 holds(clear(c),s0) # label(initial_state7) # label(axiom). [assumption].
% 5.19/5.51 18 holds(on(c,d),s0) # label(initial_state3) # label(axiom). [assumption].
% 5.19/5.51 20 -holds(and(on(c,a),on(d,b)),A) # label(prove_CA_DB) # label(negated_conjecture) # answer(prove_CA_DB). [assumption].
% 5.19/5.51 21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom). [assumption].
% 5.19/5.51 22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom). [assumption].
% 5.19/5.51 23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom). [assumption].
% 5.19/5.51 24 holds(on(A,B),do(putdown(C,D),E)) | -holds(on(A,B),E) # label(putdown_4) # label(axiom). [assumption].
% 5.19/5.51 25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom). [assumption].
% 5.19/5.51 26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom). [assumption].
% 5.19/5.51 27 holds(on(A,B),do(pickup(C),D)) | -holds(on(A,B),D) | -differ(A,C) # label(pickup_3) # label(axiom). [assumption].
% 5.19/5.51 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.19/5.51 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.19/5.51 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.19/5.51 39 differ(d,a). [ur(21,b,3,a)].
% 5.19/5.51 41 differ(b,a). [ur(21,b,1,a)].
% 5.19/5.51 42 -holds(on(c,a),A) | -holds(on(d,b),A) # answer(prove_CA_DB). [resolve(22,a,20,a)].
% 5.19/5.51 128 holds(clear(b),do(pickup(c),s0)). [ur(23,b,13,a,c,5,a)].
% 5.19/5.51 131 holds(clear(a),do(pickup(c),s0)). [ur(23,b,12,a,c,2,a)].
% 5.19/5.51 156 holds(holding(c),do(pickup(c),s0)). [ur(29,b,11,a,c,14,a,d,9,a)].
% 5.19/5.51 159 holds(clear(d),do(pickup(c),s0)). [ur(31,b,18,a,c,14,a,d,11,a)].
% 5.19/5.51 162 -holds(on(d,b),do(putdown(A,B),C)) | -holds(on(c,a),C) # answer(prove_CA_DB). [resolve(42,a,24,a)].
% 5.19/5.51 168 -holds(on(d,b),do(putdown(A,B),do(pickup(C),D))) | -holds(on(c,a),D) | -differ(c,C) # answer(prove_CA_DB). [resolve(162,b,27,a)].
% 5.19/5.51 3031 holds(clear(b),do(putdown(A,a),do(pickup(c),s0))). [ur(26,b,128,a,c,41,a)].
% 5.19/5.51 3226 holds(on(c,a),do(putdown(c,a),do(pickup(c),s0))). [ur(30,b,156,a,c,131,a)].
% 5.19/5.51 3232 holds(empty,do(putdown(c,a),do(pickup(c),s0))). [ur(25,b,156,a,c,131,a)].
% 5.19/5.51 3381 holds(clear(d),do(putdown(A,a),do(pickup(c),s0))). [ur(26,b,159,a,c,39,a)].
% 5.19/5.51 5420 -holds(on(d,b),do(putdown(A,B),do(pickup(d),C))) | -holds(on(c,a),C) # answer(prove_CA_DB). [resolve(168,c,8,a)].
% 5.19/5.51 5529 -holds(on(c,a),A) | -holds(holding(d),do(pickup(d),A)) | -holds(clear(b),do(pickup(d),A)) # answer(prove_CA_DB). [resolve(5420,a,30,a)].
% 5.19/5.51 5844 -holds(on(c,a),A) | -holds(holding(d),do(pickup(d),A)) | -holds(clear(b),A) | -differ(b,d) # answer(prove_CA_DB). [resolve(5529,c,23,a)].
% 5.19/5.51 6238 -holds(on(c,a),A) | -holds(holding(d),do(pickup(d),A)) | -holds(clear(b),A) # answer(prove_CA_DB). [resolve(5844,d,6,a)].
% 5.19/5.51 6242 -holds(on(c,a),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(d),A) | -differ(d,table) # answer(prove_CA_DB). [resolve(6238,b,29,a)].
% 5.19/5.51 6511 -holds(on(c,a),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(d),A) # answer(prove_CA_DB). [resolve(6242,e,10,a)].
% 5.19/5.51 11785 -holds(on(c,a),do(putdown(c,a),do(pickup(c),s0))) # answer(prove_CA_DB). [ur(6511,b,3031,a,c,3232,a,d,3381,a)].
% 5.19/5.51 11786 $F # answer(prove_CA_DB). [resolve(11785,a,3226,a)].
% 5.19/5.51
% 5.19/5.51 % SZS output end Refutation
% 5.19/5.51 ============================== end of proof ==========================
% 5.19/5.51
% 5.19/5.51 ============================== STATISTICS ============================
% 5.19/5.51
% 5.19/5.51 Given=2621. Generated=1382588. Kept=11785. proofs=1.
% 5.19/5.51 Usable=2596. Sos=9039. Demods=0. Limbo=1, Disabled=179. Hints=0.
% 5.19/5.51 Megabytes=11.55.
% 5.19/5.51 User_CPU=3.84, System_CPU=0.72, Wall_clock=4.
% 5.19/5.51
% 5.19/5.51 ============================== end of statistics =====================
% 5.19/5.51
% 5.19/5.51 ============================== end of search =========================
% 5.19/5.51
% 5.19/5.51 THEOREM PROVED
% 5.19/5.51 % SZS status Unsatisfiable
% 5.19/5.51
% 5.19/5.51 Exiting with 1 proof.
% 5.19/5.51
% 5.19/5.51 Process 16396 exit (max_proofs) Tue May 31 23:10:46 2022
% 5.19/5.51 Prover9 interrupted
%------------------------------------------------------------------------------