TSTP Solution File: PLA019-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA019-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:23 EDT 2022
% Result : Unsatisfiable 2.08s 2.37s
% Output : Refutation 2.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PLA019-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 : n029.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:28:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.08/2.37 ============================== Prover9 ===============================
% 2.08/2.37 Prover9 (32) version 2009-11A, November 2009.
% 2.08/2.37 Process 30968 was started by sandbox on n029.cluster.edu,
% 2.08/2.37 Tue May 31 23:28:01 2022
% 2.08/2.37 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30815_n029.cluster.edu".
% 2.08/2.37 ============================== end of head ===========================
% 2.08/2.37
% 2.08/2.37 ============================== INPUT =================================
% 2.08/2.37
% 2.08/2.37 % Reading from file /tmp/Prover9_30815_n029.cluster.edu
% 2.08/2.37
% 2.08/2.37 set(prolog_style_variables).
% 2.08/2.37 set(auto2).
% 2.08/2.37 % set(auto2) -> set(auto).
% 2.08/2.37 % set(auto) -> set(auto_inference).
% 2.08/2.37 % set(auto) -> set(auto_setup).
% 2.08/2.37 % set(auto_setup) -> set(predicate_elim).
% 2.08/2.37 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.08/2.37 % set(auto) -> set(auto_limits).
% 2.08/2.37 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.08/2.37 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.08/2.37 % set(auto) -> set(auto_denials).
% 2.08/2.37 % set(auto) -> set(auto_process).
% 2.08/2.37 % set(auto2) -> assign(new_constants, 1).
% 2.08/2.37 % set(auto2) -> assign(fold_denial_max, 3).
% 2.08/2.37 % set(auto2) -> assign(max_weight, "200.000").
% 2.08/2.37 % set(auto2) -> assign(max_hours, 1).
% 2.08/2.37 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.08/2.37 % set(auto2) -> assign(max_seconds, 0).
% 2.08/2.37 % set(auto2) -> assign(max_minutes, 5).
% 2.08/2.37 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.08/2.37 % set(auto2) -> set(sort_initial_sos).
% 2.08/2.37 % set(auto2) -> assign(sos_limit, -1).
% 2.08/2.37 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.08/2.37 % set(auto2) -> assign(max_megs, 400).
% 2.08/2.37 % set(auto2) -> assign(stats, some).
% 2.08/2.37 % set(auto2) -> clear(echo_input).
% 2.08/2.37 % set(auto2) -> set(quiet).
% 2.08/2.37 % set(auto2) -> clear(print_initial_clauses).
% 2.08/2.37 % set(auto2) -> clear(print_given).
% 2.08/2.37 assign(lrs_ticks,-1).
% 2.08/2.37 assign(sos_limit,10000).
% 2.08/2.37 assign(order,kbo).
% 2.08/2.37 set(lex_order_vars).
% 2.08/2.37 clear(print_given).
% 2.08/2.37
% 2.08/2.37 % formulas(sos). % not echoed (31 formulas)
% 2.08/2.37
% 2.08/2.37 ============================== end of input ==========================
% 2.08/2.37
% 2.08/2.37 % From the command line: assign(max_seconds, 300).
% 2.08/2.37
% 2.08/2.37 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.08/2.37
% 2.08/2.37 % Formulas that are not ordinary clauses:
% 2.08/2.37
% 2.08/2.37 ============================== end of process non-clausal formulas ===
% 2.08/2.37
% 2.08/2.37 ============================== PROCESS INITIAL CLAUSES ===============
% 2.08/2.37
% 2.08/2.37 ============================== PREDICATE ELIMINATION =================
% 2.08/2.37
% 2.08/2.37 ============================== end predicate elimination =============
% 2.08/2.37
% 2.08/2.37 Auto_denials:
% 2.08/2.37 % copying label prove_DC to answer in negative clause
% 2.08/2.37
% 2.08/2.37 Term ordering decisions:
% 2.08/2.37 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.
% 2.08/2.37
% 2.08/2.37 ============================== end of process initial clauses ========
% 2.08/2.37
% 2.08/2.37 ============================== CLAUSES FOR SEARCH ====================
% 2.08/2.37
% 2.08/2.37 ============================== end of clauses for search =============
% 2.08/2.37
% 2.08/2.37 ============================== SEARCH ================================
% 2.08/2.37
% 2.08/2.37 % Starting search at 0.01 seconds.
% 2.08/2.37
% 2.08/2.37 Low Water (keep): wt=15.000, iters=3506
% 2.08/2.37
% 2.08/2.37 Low Water (keep): wt=14.000, iters=3358
% 2.08/2.37
% 2.08/2.37 Low Water (keep): wt=13.000, iters=3339
% 2.08/2.37
% 2.08/2.37 Low Water (keep): wt=12.000, iters=3350
% 2.08/2.37
% 2.08/2.37 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 238 (0.00 of 0.36 sec).
% 2.08/2.37
% 2.08/2.37 ============================== PROOF =================================
% 2.08/2.37 % SZS status Unsatisfiable
% 2.08/2.37 % SZS output start Refutation
% 2.08/2.37
% 2.08/2.37 % Proof 1 at 1.21 (+ 0.20) seconds: prove_DC.
% 2.08/2.37 % Length of proof is 30.
% 2.08/2.37 % Level of proof is 6.
% 2.08/2.37 % Maximum clause weight is 22.000.
% 2.08/2.37 % Given clauses 1417.
% 2.08/2.37
% 2.08/2.37 2 differ(a,c) # label(differ_a_c) # label(axiom). [assumption].
% 2.08/2.37 3 differ(a,d) # label(differ_a_d) # label(axiom). [assumption].
% 2.08/2.37 8 differ(c,d) # label(differ_c_d) # label(axiom). [assumption].
% 2.08/2.37 9 differ(c,table) # label(differ_c_table) # label(axiom). [assumption].
% 2.08/2.37 10 differ(d,table) # label(differ_d_table) # label(axiom). [assumption].
% 2.08/2.37 11 holds(empty,s0) # label(initial_state8) # label(axiom). [assumption].
% 2.08/2.37 12 holds(clear(a),s0) # label(initial_state5) # label(axiom). [assumption].
% 2.08/2.37 14 holds(clear(c),s0) # label(initial_state7) # label(axiom). [assumption].
% 2.08/2.37 18 holds(on(c,d),s0) # label(initial_state3) # label(axiom). [assumption].
% 2.08/2.37 20 -holds(on(d,c),A) # label(prove_DC) # label(negated_conjecture) # answer(prove_DC). [assumption].
% 2.08/2.37 21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom). [assumption].
% 2.08/2.37 23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom). [assumption].
% 2.08/2.37 25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom). [assumption].
% 2.08/2.37 26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom). [assumption].
% 2.08/2.37 28 holds(clear(A),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_3) # label(axiom). [assumption].
% 2.08/2.37 29 holds(holding(A),do(pickup(A),B)) | -holds(empty,B) | -holds(clear(A),B) | -differ(A,table) # label(pickup_1) # label(axiom). [assumption].
% 2.08/2.37 30 holds(on(A,B),do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_2) # label(axiom). [assumption].
% 2.08/2.37 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].
% 2.08/2.37 39 differ(d,a). [ur(21,b,3,a)].
% 2.08/2.37 130 holds(clear(a),do(pickup(c),s0)). [ur(23,b,12,a,c,2,a)].
% 2.08/2.37 155 holds(holding(c),do(pickup(c),s0)). [ur(29,b,11,a,c,14,a,d,9,a)].
% 2.08/2.37 158 -holds(holding(d),A) | -holds(clear(c),A) # answer(prove_DC). [resolve(30,a,20,a)].
% 2.08/2.37 160 holds(clear(d),do(pickup(c),s0)). [ur(31,b,18,a,c,14,a,d,11,a)].
% 2.08/2.37 165 -holds(holding(d),do(pickup(A),B)) | -holds(clear(c),B) | -differ(c,A) # answer(prove_DC). [resolve(158,b,23,a)].
% 2.08/2.37 168 -holds(holding(d),do(pickup(A),do(putdown(c,B),C))) | -differ(c,A) | -holds(holding(c),C) | -holds(clear(B),C) # answer(prove_DC). [resolve(165,b,28,a)].
% 2.08/2.37 3225 holds(empty,do(putdown(c,a),do(pickup(c),s0))). [ur(25,b,155,a,c,130,a)].
% 2.08/2.37 3372 holds(clear(d),do(putdown(A,a),do(pickup(c),s0))). [ur(26,b,160,a,c,39,a)].
% 2.08/2.37 5534 -holds(holding(d),do(pickup(d),do(putdown(c,a),do(pickup(c),s0)))) # answer(prove_DC). [ur(168,b,8,a,c,155,a,d,130,a)].
% 2.08/2.37 7868 -holds(clear(d),do(putdown(c,a),do(pickup(c),s0))) # answer(prove_DC). [ur(29,a,5534,a,b,3225,a,d,10,a)].
% 2.08/2.37 7869 $F # answer(prove_DC). [resolve(7868,a,3372,a)].
% 2.08/2.37
% 2.08/2.37 % SZS output end Refutation
% 2.08/2.37 ============================== end of proof ==========================
% 2.08/2.37
% 2.08/2.37 ============================== STATISTICS ============================
% 2.08/2.37
% 2.08/2.37 Given=1417. Generated=393789. Kept=7868. proofs=1.
% 2.08/2.37 Usable=1414. Sos=6417. Demods=0. Limbo=10, Disabled=57. Hints=0.
% 2.08/2.37 Megabytes=6.09.
% 2.08/2.37 User_CPU=1.21, System_CPU=0.20, Wall_clock=1.
% 2.08/2.37
% 2.08/2.37 ============================== end of statistics =====================
% 2.08/2.37
% 2.08/2.37 ============================== end of search =========================
% 2.08/2.37
% 2.08/2.37 THEOREM PROVED
% 2.08/2.37 % SZS status Unsatisfiable
% 2.08/2.37
% 2.08/2.37 Exiting with 1 proof.
% 2.08/2.37
% 2.08/2.37 Process 30968 exit (max_proofs) Tue May 31 23:28:02 2022
% 2.08/2.37 Prover9 interrupted
%------------------------------------------------------------------------------