TSTP Solution File: PLA009-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA009-1 : TPTP v8.1.0. Released v1.1.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 : Mon Jul 18 17:31:22 EDT 2022
% Result : Unsatisfiable 5.12s 5.45s
% Output : Refutation 5.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PLA009-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/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 : Tue May 31 19:23:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 5.12/5.45 ============================== Prover9 ===============================
% 5.12/5.45 Prover9 (32) version 2009-11A, November 2009.
% 5.12/5.45 Process 6236 was started by sandbox on n020.cluster.edu,
% 5.12/5.45 Tue May 31 19:23:24 2022
% 5.12/5.45 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6083_n020.cluster.edu".
% 5.12/5.45 ============================== end of head ===========================
% 5.12/5.45
% 5.12/5.45 ============================== INPUT =================================
% 5.12/5.45
% 5.12/5.45 % Reading from file /tmp/Prover9_6083_n020.cluster.edu
% 5.12/5.45
% 5.12/5.45 set(prolog_style_variables).
% 5.12/5.45 set(auto2).
% 5.12/5.45 % set(auto2) -> set(auto).
% 5.12/5.45 % set(auto) -> set(auto_inference).
% 5.12/5.45 % set(auto) -> set(auto_setup).
% 5.12/5.45 % set(auto_setup) -> set(predicate_elim).
% 5.12/5.45 % set(auto_setup) -> assign(eq_defs, unfold).
% 5.12/5.45 % set(auto) -> set(auto_limits).
% 5.12/5.45 % set(auto_limits) -> assign(max_weight, "100.000").
% 5.12/5.45 % set(auto_limits) -> assign(sos_limit, 20000).
% 5.12/5.45 % set(auto) -> set(auto_denials).
% 5.12/5.45 % set(auto) -> set(auto_process).
% 5.12/5.45 % set(auto2) -> assign(new_constants, 1).
% 5.12/5.45 % set(auto2) -> assign(fold_denial_max, 3).
% 5.12/5.45 % set(auto2) -> assign(max_weight, "200.000").
% 5.12/5.45 % set(auto2) -> assign(max_hours, 1).
% 5.12/5.45 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 5.12/5.45 % set(auto2) -> assign(max_seconds, 0).
% 5.12/5.45 % set(auto2) -> assign(max_minutes, 5).
% 5.12/5.45 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 5.12/5.45 % set(auto2) -> set(sort_initial_sos).
% 5.12/5.45 % set(auto2) -> assign(sos_limit, -1).
% 5.12/5.45 % set(auto2) -> assign(lrs_ticks, 3000).
% 5.12/5.45 % set(auto2) -> assign(max_megs, 400).
% 5.12/5.45 % set(auto2) -> assign(stats, some).
% 5.12/5.45 % set(auto2) -> clear(echo_input).
% 5.12/5.45 % set(auto2) -> set(quiet).
% 5.12/5.45 % set(auto2) -> clear(print_initial_clauses).
% 5.12/5.45 % set(auto2) -> clear(print_given).
% 5.12/5.45 assign(lrs_ticks,-1).
% 5.12/5.45 assign(sos_limit,10000).
% 5.12/5.45 assign(order,kbo).
% 5.12/5.45 set(lex_order_vars).
% 5.12/5.45 clear(print_given).
% 5.12/5.45
% 5.12/5.45 % formulas(sos). % not echoed (31 formulas)
% 5.12/5.45
% 5.12/5.45 ============================== end of input ==========================
% 5.12/5.45
% 5.12/5.45 % From the command line: assign(max_seconds, 300).
% 5.12/5.45
% 5.12/5.45 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 5.12/5.45
% 5.12/5.45 % Formulas that are not ordinary clauses:
% 5.12/5.45
% 5.12/5.45 ============================== end of process non-clausal formulas ===
% 5.12/5.45
% 5.12/5.45 ============================== PROCESS INITIAL CLAUSES ===============
% 5.12/5.45
% 5.12/5.45 ============================== PREDICATE ELIMINATION =================
% 5.12/5.45
% 5.12/5.45 ============================== end predicate elimination =============
% 5.12/5.45
% 5.12/5.45 Auto_denials:
% 5.12/5.45 % copying label prove_AB_D to answer in negative clause
% 5.12/5.45
% 5.12/5.45 Term ordering decisions:
% 5.12/5.45 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.12/5.45
% 5.12/5.45 ============================== end of process initial clauses ========
% 5.12/5.45
% 5.12/5.45 ============================== CLAUSES FOR SEARCH ====================
% 5.12/5.45
% 5.12/5.45 ============================== end of clauses for search =============
% 5.12/5.45
% 5.12/5.45 ============================== SEARCH ================================
% 5.12/5.45
% 5.12/5.45 % Starting search at 0.01 seconds.
% 5.12/5.45
% 5.12/5.45 Low Water (keep): wt=15.000, iters=3506
% 5.12/5.45
% 5.12/5.45 Low Water (keep): wt=14.000, iters=3358
% 5.12/5.45
% 5.12/5.45 Low Water (keep): wt=13.000, iters=3339
% 5.12/5.45
% 5.12/5.45 Low Water (keep): wt=12.000, iters=3350
% 5.12/5.45
% 5.12/5.45 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 90 (0.00 of 0.34 sec).
% 5.12/5.45
% 5.12/5.45 ============================== PROOF =================================
% 5.12/5.45 % SZS status Unsatisfiable
% 5.12/5.45 % SZS output start Refutation
% 5.12/5.45
% 5.12/5.45 % Proof 1 at 3.76 (+ 0.73) seconds: prove_AB_D.
% 5.12/5.45 % Length of proof is 47.
% 5.12/5.45 % Level of proof is 12.
% 5.12/5.45 % Maximum clause weight is 19.000.
% 5.12/5.45 % Given clauses 2584.
% 5.12/5.45
% 5.12/5.45 1 differ(a,b) # label(differ_a_b) # label(axiom). [assumption].
% 5.12/5.45 2 differ(a,c) # label(differ_a_c) # label(axiom). [assumption].
% 5.12/5.45 3 differ(a,d) # label(differ_a_d) # label(axiom). [assumption].
% 5.12/5.45 4 differ(a,table) # label(differ_a_table) # label(axiom). [assumption].
% 5.12/5.45 5 differ(b,c) # label(differ_b_c) # label(axiom). [assumption].
% 5.12/5.45 6 differ(b,d) # label(differ_b_d) # label(axiom). [assumption].
% 5.12/5.45 7 differ(b,table) # label(differ_b_table) # label(axiom). [assumption].
% 5.12/5.45 9 differ(c,table) # label(differ_c_table) # label(axiom). [assumption].
% 5.12/5.45 10 differ(d,table) # label(differ_d_table) # label(axiom). [assumption].
% 5.12/5.45 11 holds(empty,s0) # label(initial_state8) # label(axiom). [assumption].
% 5.12/5.45 12 holds(clear(a),s0) # label(initial_state5) # label(axiom). [assumption].
% 5.12/5.45 13 holds(clear(b),s0) # label(initial_state6) # label(axiom). [assumption].
% 5.12/5.45 14 holds(clear(c),s0) # label(initial_state7) # label(axiom). [assumption].
% 5.12/5.45 15 holds(clear(table),A) # label(clear_table) # label(axiom). [assumption].
% 5.12/5.45 18 holds(on(c,d),s0) # label(initial_state3) # label(axiom). [assumption].
% 5.12/5.45 20 -holds(and(on(a,b),clear(d)),A) # label(prove_AB_D) # label(negated_conjecture) # answer(prove_AB_D). [assumption].
% 5.12/5.45 21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom). [assumption].
% 5.12/5.45 22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom). [assumption].
% 5.12/5.45 23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom). [assumption].
% 5.12/5.45 25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom). [assumption].
% 5.12/5.45 26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom). [assumption].
% 5.12/5.45 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.12/5.45 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.12/5.45 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.12/5.45 36 differ(d,b). [ur(21,b,6,a)].
% 5.12/5.45 39 differ(d,a). [ur(21,b,3,a)].
% 5.12/5.45 41 differ(b,a). [ur(21,b,1,a)].
% 5.12/5.45 42 -holds(on(a,b),A) | -holds(clear(d),A) # answer(prove_AB_D). [resolve(22,a,20,a)].
% 5.12/5.45 128 holds(clear(b),do(pickup(c),s0)). [ur(23,b,13,a,c,5,a)].
% 5.12/5.45 131 holds(clear(a),do(pickup(c),s0)). [ur(23,b,12,a,c,2,a)].
% 5.12/5.45 156 holds(holding(c),do(pickup(c),s0)). [ur(29,b,11,a,c,14,a,d,9,a)].
% 5.12/5.45 159 holds(clear(d),do(pickup(c),s0)). [ur(31,b,18,a,c,14,a,d,11,a)].
% 5.12/5.45 165 -holds(on(a,b),do(putdown(A,B),C)) | -holds(clear(d),C) | -differ(d,B) # answer(prove_AB_D). [resolve(42,b,26,a)].
% 5.12/5.45 1456 -holds(on(a,b),do(putdown(A,b),B)) | -holds(clear(d),B) # answer(prove_AB_D). [resolve(165,c,36,a)].
% 5.12/5.45 1467 -holds(on(a,b),do(putdown(A,b),do(pickup(B),C))) | -holds(clear(d),C) | -differ(d,B) # answer(prove_AB_D). [resolve(1456,b,23,a)].
% 5.12/5.45 3062 holds(clear(b),do(putdown(A,table),do(pickup(c),s0))). [ur(26,b,128,a,c,7,a)].
% 5.12/5.45 3218 holds(clear(a),do(putdown(A,table),do(pickup(c),s0))). [ur(26,b,131,a,c,4,a)].
% 5.12/5.45 3254 holds(empty,do(putdown(c,table),do(pickup(c),s0))). [ur(25,b,156,a,c,15,a)].
% 5.12/5.45 3435 holds(clear(d),do(putdown(A,table),do(pickup(c),s0))). [ur(26,b,159,a,c,10,a)].
% 5.12/5.45 7006 -holds(on(a,b),do(putdown(A,b),do(pickup(a),B))) | -holds(clear(d),B) # answer(prove_AB_D). [resolve(1467,c,39,a)].
% 5.12/5.45 7019 -holds(clear(d),A) | -holds(holding(a),do(pickup(a),A)) | -holds(clear(b),do(pickup(a),A)) # answer(prove_AB_D). [resolve(7006,a,30,a)].
% 5.12/5.45 7046 -holds(clear(d),A) | -holds(holding(a),do(pickup(a),A)) | -holds(clear(b),A) | -differ(b,a) # answer(prove_AB_D). [resolve(7019,c,23,a)].
% 5.12/5.45 7083 -holds(clear(d),A) | -holds(holding(a),do(pickup(a),A)) | -holds(clear(b),A) # answer(prove_AB_D). [resolve(7046,d,41,a)].
% 5.12/5.45 7091 -holds(clear(d),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(a),A) | -differ(a,table) # answer(prove_AB_D). [resolve(7083,b,29,a)].
% 5.12/5.45 7214 -holds(clear(d),A) | -holds(clear(b),A) | -holds(empty,A) | -holds(clear(a),A) # answer(prove_AB_D). [resolve(7091,e,4,a)].
% 5.12/5.45 11303 -holds(clear(d),do(putdown(c,table),do(pickup(c),s0))) # answer(prove_AB_D). [ur(7214,b,3062,a,c,3254,a,d,3218,a)].
% 5.12/5.45 11304 $F # answer(prove_AB_D). [resolve(11303,a,3435,a)].
% 5.12/5.45
% 5.12/5.45 % SZS output end Refutation
% 5.12/5.45 ============================== end of proof ==========================
% 5.12/5.45
% 5.12/5.45 ============================== STATISTICS ============================
% 5.12/5.45
% 5.12/5.45 Given=2584. Generated=1381763. Kept=11303. proofs=1.
% 5.12/5.45 Usable=2568. Sos=8664. Demods=0. Limbo=0, Disabled=101. Hints=0.
% 5.12/5.45 Megabytes=10.67.
% 5.12/5.45 User_CPU=3.77, System_CPU=0.73, Wall_clock=4.
% 5.12/5.45
% 5.12/5.45 ============================== end of statistics =====================
% 5.12/5.45
% 5.12/5.45 ============================== end of search =========================
% 5.12/5.45
% 5.12/5.45 THEOREM PROVED
% 5.12/5.45 % SZS status Unsatisfiable
% 5.12/5.45
% 5.12/5.45 Exiting with 1 proof.
% 5.12/5.45
% 5.12/5.45 Process 6236 exit (max_proofs) Tue May 31 19:23:28 2022
% 5.12/5.45 Prover9 interrupted
%------------------------------------------------------------------------------