TSTP Solution File: PLA023-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA023-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:24 EDT 2022
% Result : Unsatisfiable 203.11s 203.55s
% Output : Refutation 203.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PLA023-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 21:25:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 203.11/203.55 ============================== Prover9 ===============================
% 203.11/203.55 Prover9 (32) version 2009-11A, November 2009.
% 203.11/203.55 Process 5014 was started by sandbox2 on n024.cluster.edu,
% 203.11/203.55 Tue May 31 21:25:22 2022
% 203.11/203.55 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4860_n024.cluster.edu".
% 203.11/203.55 ============================== end of head ===========================
% 203.11/203.55
% 203.11/203.55 ============================== INPUT =================================
% 203.11/203.55
% 203.11/203.55 % Reading from file /tmp/Prover9_4860_n024.cluster.edu
% 203.11/203.55
% 203.11/203.55 set(prolog_style_variables).
% 203.11/203.55 set(auto2).
% 203.11/203.55 % set(auto2) -> set(auto).
% 203.11/203.55 % set(auto) -> set(auto_inference).
% 203.11/203.55 % set(auto) -> set(auto_setup).
% 203.11/203.55 % set(auto_setup) -> set(predicate_elim).
% 203.11/203.55 % set(auto_setup) -> assign(eq_defs, unfold).
% 203.11/203.55 % set(auto) -> set(auto_limits).
% 203.11/203.55 % set(auto_limits) -> assign(max_weight, "100.000").
% 203.11/203.55 % set(auto_limits) -> assign(sos_limit, 20000).
% 203.11/203.55 % set(auto) -> set(auto_denials).
% 203.11/203.55 % set(auto) -> set(auto_process).
% 203.11/203.55 % set(auto2) -> assign(new_constants, 1).
% 203.11/203.55 % set(auto2) -> assign(fold_denial_max, 3).
% 203.11/203.55 % set(auto2) -> assign(max_weight, "200.000").
% 203.11/203.55 % set(auto2) -> assign(max_hours, 1).
% 203.11/203.55 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 203.11/203.55 % set(auto2) -> assign(max_seconds, 0).
% 203.11/203.55 % set(auto2) -> assign(max_minutes, 5).
% 203.11/203.55 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 203.11/203.55 % set(auto2) -> set(sort_initial_sos).
% 203.11/203.55 % set(auto2) -> assign(sos_limit, -1).
% 203.11/203.55 % set(auto2) -> assign(lrs_ticks, 3000).
% 203.11/203.55 % set(auto2) -> assign(max_megs, 400).
% 203.11/203.55 % set(auto2) -> assign(stats, some).
% 203.11/203.55 % set(auto2) -> clear(echo_input).
% 203.11/203.55 % set(auto2) -> set(quiet).
% 203.11/203.55 % set(auto2) -> clear(print_initial_clauses).
% 203.11/203.55 % set(auto2) -> clear(print_given).
% 203.11/203.55 assign(lrs_ticks,-1).
% 203.11/203.55 assign(sos_limit,10000).
% 203.11/203.55 assign(order,kbo).
% 203.11/203.55 set(lex_order_vars).
% 203.11/203.55 clear(print_given).
% 203.11/203.55
% 203.11/203.55 % formulas(sos). % not echoed (31 formulas)
% 203.11/203.55
% 203.11/203.55 ============================== end of input ==========================
% 203.11/203.55
% 203.11/203.55 % From the command line: assign(max_seconds, 300).
% 203.11/203.55
% 203.11/203.55 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 203.11/203.55
% 203.11/203.55 % Formulas that are not ordinary clauses:
% 203.11/203.55
% 203.11/203.55 ============================== end of process non-clausal formulas ===
% 203.11/203.55
% 203.11/203.55 ============================== PROCESS INITIAL CLAUSES ===============
% 203.11/203.55
% 203.11/203.55 ============================== PREDICATE ELIMINATION =================
% 203.11/203.55
% 203.11/203.55 ============================== end predicate elimination =============
% 203.11/203.55
% 203.11/203.55 Auto_denials:
% 203.11/203.55 % copying label prove_DAC to answer in negative clause
% 203.11/203.55
% 203.11/203.55 Term ordering decisions:
% 203.11/203.55 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.
% 203.11/203.55
% 203.11/203.55 ============================== end of process initial clauses ========
% 203.11/203.55
% 203.11/203.55 ============================== CLAUSES FOR SEARCH ====================
% 203.11/203.55
% 203.11/203.55 ============================== end of clauses for search =============
% 203.11/203.55
% 203.11/203.55 ============================== SEARCH ================================
% 203.11/203.55
% 203.11/203.55 % Starting search at 0.01 seconds.
% 203.11/203.55
% 203.11/203.55 Low Water (keep): wt=15.000, iters=3506
% 203.11/203.55
% 203.11/203.55 Low Water (keep): wt=14.000, iters=3358
% 203.11/203.55
% 203.11/203.55 Low Water (keep): wt=13.000, iters=3339
% 203.11/203.55
% 203.11/203.55 Low Water (keep): wt=12.000, iters=3350
% 203.11/203.55
% 203.11/203.55 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 43 (0.00 of 0.42 sec).
% 203.11/203.55
% 203.11/203.55 ============================== PROOF =================================
% 203.11/203.55 % SZS status Unsatisfiable
% 203.11/203.55 % SZS output start Refutation
% 203.11/203.55
% 203.11/203.55 % Proof 1 at 170.57 (+ 31.84) seconds: prove_DAC.
% 203.11/203.55 % Length of proof is 52.
% 203.11/203.55 % Level of proof is 19.
% 203.11/203.55 % Maximum clause weight is 31.000.
% 203.11/203.55 % Given clauses 16152.
% 203.11/203.55
% 203.11/203.55 2 differ(a,c) # label(differ_a_c) # label(axiom). [assumption].
% 203.11/203.55 3 differ(a,d) # label(differ_a_d) # label(axiom). [assumption].
% 203.11/203.55 4 differ(a,table) # label(differ_a_table) # label(axiom). [assumption].
% 203.11/203.55 8 differ(c,d) # label(differ_c_d) # label(axiom). [assumption].
% 203.11/203.55 9 differ(c,table) # label(differ_c_table) # label(axiom). [assumption].
% 203.11/203.55 10 differ(d,table) # label(differ_d_table) # label(axiom). [assumption].
% 203.11/203.55 11 holds(empty,s0) # label(initial_state8) # label(axiom). [assumption].
% 203.11/203.55 12 holds(clear(a),s0) # label(initial_state5) # label(axiom). [assumption].
% 203.11/203.55 14 holds(clear(c),s0) # label(initial_state7) # label(axiom). [assumption].
% 203.11/203.55 15 holds(clear(table),A) # label(clear_table) # label(axiom). [assumption].
% 203.11/203.55 18 holds(on(c,d),s0) # label(initial_state3) # label(axiom). [assumption].
% 203.11/203.55 20 -holds(and(on(d,a),on(a,c)),A) # label(prove_DAC) # label(negated_conjecture) # answer(prove_DAC). [assumption].
% 203.11/203.55 21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom). [assumption].
% 203.11/203.55 22 holds(and(A,B),C) | -holds(A,C) | -holds(B,C) # label(and_definition) # label(axiom). [assumption].
% 203.11/203.55 23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom). [assumption].
% 203.11/203.55 24 holds(on(A,B),do(putdown(C,D),E)) | -holds(on(A,B),E) # label(putdown_4) # label(axiom). [assumption].
% 203.11/203.55 25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom). [assumption].
% 203.11/203.55 26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom). [assumption].
% 203.11/203.55 27 holds(on(A,B),do(pickup(C),D)) | -holds(on(A,B),D) | -differ(A,C) # label(pickup_3) # label(axiom). [assumption].
% 203.11/203.55 28 holds(clear(A),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_3) # label(axiom). [assumption].
% 203.11/203.55 29 holds(holding(A),do(pickup(A),B)) | -holds(empty,B) | -holds(clear(A),B) | -differ(A,table) # label(pickup_1) # label(axiom). [assumption].
% 203.11/203.55 30 holds(on(A,B),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_2) # label(axiom). [assumption].
% 203.11/203.55 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].
% 203.11/203.55 34 differ(d,c). [ur(21,b,8,a)].
% 203.11/203.55 39 differ(d,a). [ur(21,b,3,a)].
% 203.11/203.55 40 differ(c,a). [ur(21,b,2,a)].
% 203.11/203.55 42 -holds(on(d,a),A) | -holds(on(a,c),A) # answer(prove_DAC). [resolve(22,a,20,a)].
% 203.11/203.55 131 holds(clear(a),do(pickup(c),s0)). [ur(23,b,12,a,c,2,a)].
% 203.11/203.55 156 holds(holding(c),do(pickup(c),s0)). [ur(29,b,11,a,c,14,a,d,9,a)].
% 203.11/203.55 159 holds(clear(d),do(pickup(c),s0)). [ur(31,b,18,a,c,14,a,d,11,a)].
% 203.11/203.55 165 -holds(on(d,a),do(putdown(A,B),C)) | -holds(on(a,c),C) # answer(prove_DAC). [resolve(42,b,24,a)].
% 203.11/203.55 184 -holds(on(a,c),A) | -holds(holding(d),A) | -holds(clear(a),A) # answer(prove_DAC). [resolve(165,a,30,a)].
% 203.11/203.55 189 -holds(holding(d),do(pickup(A),B)) | -holds(clear(a),do(pickup(A),B)) | -holds(on(a,c),B) | -differ(a,A) # answer(prove_DAC). [resolve(184,a,27,a)].
% 203.11/203.55 3190 holds(clear(a),do(putdown(A,table),do(pickup(c),s0))). [ur(26,b,131,a,c,4,a)].
% 203.11/203.55 3225 holds(clear(c),do(putdown(c,table),do(pickup(c),s0))). [ur(28,b,156,a,c,15,a)].
% 203.11/203.55 3228 holds(empty,do(putdown(c,table),do(pickup(c),s0))). [ur(25,b,156,a,c,15,a)].
% 203.11/203.55 3378 holds(clear(d),do(putdown(A,table),do(pickup(c),s0))). [ur(26,b,159,a,c,10,a)].
% 203.11/203.55 6167 -holds(holding(d),do(pickup(A),B)) | -holds(on(a,c),B) | -differ(a,A) | -holds(clear(a),B) # answer(prove_DAC). [resolve(189,b,23,a),merge(e)].
% 203.11/203.55 6372 -holds(holding(d),do(pickup(d),A)) | -holds(on(a,c),A) | -holds(clear(a),A) # answer(prove_DAC). [resolve(6167,c,3,a)].
% 203.11/203.55 6437 -holds(on(a,c),A) | -holds(clear(a),A) | -holds(empty,A) | -holds(clear(d),A) | -differ(d,table) # answer(prove_DAC). [resolve(6372,a,29,a)].
% 203.11/203.55 6788 -holds(on(a,c),A) | -holds(clear(a),A) | -holds(empty,A) | -holds(clear(d),A) # answer(prove_DAC). [resolve(6437,e,10,a)].
% 203.11/203.55 6797 -holds(clear(a),do(putdown(a,c),A)) | -holds(empty,do(putdown(a,c),A)) | -holds(clear(d),do(putdown(a,c),A)) | -holds(holding(a),A) | -holds(clear(c),A) # answer(prove_DAC). [resolve(6788,a,30,a)].
% 203.11/203.55 24490 -holds(empty,do(putdown(a,c),A)) | -holds(clear(d),do(putdown(a,c),A)) | -holds(holding(a),A) | -holds(clear(c),A) # answer(prove_DAC). [resolve(6797,a,28,a),merge(e),merge(f)].
% 203.11/203.55 24492 -holds(clear(d),do(putdown(a,c),A)) | -holds(holding(a),A) | -holds(clear(c),A) # answer(prove_DAC). [resolve(24490,a,25,a),merge(d),merge(e)].
% 203.11/203.55 24496 -holds(holding(a),A) | -holds(clear(c),A) | -holds(clear(d),A) | -differ(d,c) # answer(prove_DAC). [resolve(24492,a,26,a)].
% 203.11/203.55 24640 -holds(holding(a),A) | -holds(clear(c),A) | -holds(clear(d),A) # answer(prove_DAC). [resolve(24496,d,34,a)].
% 203.11/203.55 24724 -holds(holding(a),do(pickup(A),B)) | -holds(clear(d),do(pickup(A),B)) | -holds(clear(c),B) | -differ(c,A) # answer(prove_DAC). [resolve(24640,b,23,a)].
% 203.11/203.55 24991 -holds(holding(a),do(pickup(a),A)) | -holds(clear(d),do(pickup(a),A)) | -holds(clear(c),A) # answer(prove_DAC). [resolve(24724,d,40,a)].
% 203.11/203.55 25001 -holds(holding(a),do(pickup(a),A)) | -holds(clear(c),A) | -holds(clear(d),A) | -differ(d,a) # answer(prove_DAC). [resolve(24991,b,23,a)].
% 203.11/203.55 25102 -holds(holding(a),do(pickup(a),do(putdown(c,table),do(pickup(c),s0)))) # answer(prove_DAC). [ur(25001,b,3225,a,c,3378,a,d,39,a)].
% 203.11/203.55 25110 -holds(empty,do(putdown(c,table),do(pickup(c),s0))) # answer(prove_DAC). [ur(29,a,25102,a,c,3190,a,d,4,a)].
% 203.11/203.55 25111 $F # answer(prove_DAC). [resolve(25110,a,3228,a)].
% 203.11/203.55
% 203.11/203.55 % SZS output end Refutation
% 203.11/203.55 ============================== end of proof ==========================
% 203.11/203.55
% 203.11/203.55 ============================== STATISTICS ============================
% 203.11/203.55
% 203.11/203.55 Given=16152. Generated=58156008. Kept=25110. proofs=1.
% 203.11/203.55 Usable=16128. Sos=8829. Demods=0. Limbo=1, Disabled=182. Hints=0.
% 203.11/203.55 Megabytes=24.99.
% 203.11/203.55 User_CPU=170.57, System_CPU=31.84, Wall_clock=202.
% 203.11/203.55
% 203.11/203.55 ============================== end of statistics =====================
% 203.11/203.55
% 203.11/203.55 ============================== end of search =========================
% 203.11/203.55
% 203.11/203.55 THEOREM PROVED
% 203.11/203.55 % SZS status Unsatisfiable
% 203.11/203.55
% 203.11/203.55 Exiting with 1 proof.
% 203.11/203.55
% 203.11/203.55 Process 5014 exit (max_proofs) Tue May 31 21:28:44 2022
% 203.11/203.55 Prover9 interrupted
%------------------------------------------------------------------------------