TSTP Solution File: PLA007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PLA007-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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 2.15s 2.40s
% Output : Refutation 2.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA007-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 21:50:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.15/2.40 ============================== Prover9 ===============================
% 2.15/2.40 Prover9 (32) version 2009-11A, November 2009.
% 2.15/2.40 Process 29157 was started by sandbox on n028.cluster.edu,
% 2.15/2.40 Tue May 31 21:50:52 2022
% 2.15/2.40 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29004_n028.cluster.edu".
% 2.15/2.40 ============================== end of head ===========================
% 2.15/2.40
% 2.15/2.40 ============================== INPUT =================================
% 2.15/2.40
% 2.15/2.40 % Reading from file /tmp/Prover9_29004_n028.cluster.edu
% 2.15/2.40
% 2.15/2.40 set(prolog_style_variables).
% 2.15/2.40 set(auto2).
% 2.15/2.40 % set(auto2) -> set(auto).
% 2.15/2.40 % set(auto) -> set(auto_inference).
% 2.15/2.40 % set(auto) -> set(auto_setup).
% 2.15/2.40 % set(auto_setup) -> set(predicate_elim).
% 2.15/2.40 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.15/2.40 % set(auto) -> set(auto_limits).
% 2.15/2.40 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.15/2.40 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.15/2.40 % set(auto) -> set(auto_denials).
% 2.15/2.40 % set(auto) -> set(auto_process).
% 2.15/2.40 % set(auto2) -> assign(new_constants, 1).
% 2.15/2.40 % set(auto2) -> assign(fold_denial_max, 3).
% 2.15/2.40 % set(auto2) -> assign(max_weight, "200.000").
% 2.15/2.40 % set(auto2) -> assign(max_hours, 1).
% 2.15/2.40 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.15/2.40 % set(auto2) -> assign(max_seconds, 0).
% 2.15/2.40 % set(auto2) -> assign(max_minutes, 5).
% 2.15/2.40 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.15/2.40 % set(auto2) -> set(sort_initial_sos).
% 2.15/2.40 % set(auto2) -> assign(sos_limit, -1).
% 2.15/2.40 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.15/2.40 % set(auto2) -> assign(max_megs, 400).
% 2.15/2.40 % set(auto2) -> assign(stats, some).
% 2.15/2.40 % set(auto2) -> clear(echo_input).
% 2.15/2.40 % set(auto2) -> set(quiet).
% 2.15/2.40 % set(auto2) -> clear(print_initial_clauses).
% 2.15/2.40 % set(auto2) -> clear(print_given).
% 2.15/2.40 assign(lrs_ticks,-1).
% 2.15/2.40 assign(sos_limit,10000).
% 2.15/2.40 assign(order,kbo).
% 2.15/2.40 set(lex_order_vars).
% 2.15/2.40 clear(print_given).
% 2.15/2.40
% 2.15/2.40 % formulas(sos). % not echoed (31 formulas)
% 2.15/2.40
% 2.15/2.40 ============================== end of input ==========================
% 2.15/2.40
% 2.15/2.40 % From the command line: assign(max_seconds, 300).
% 2.15/2.40
% 2.15/2.40 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.15/2.40
% 2.15/2.40 % Formulas that are not ordinary clauses:
% 2.15/2.40
% 2.15/2.40 ============================== end of process non-clausal formulas ===
% 2.15/2.40
% 2.15/2.40 ============================== PROCESS INITIAL CLAUSES ===============
% 2.15/2.40
% 2.15/2.40 ============================== PREDICATE ELIMINATION =================
% 2.15/2.40
% 2.15/2.40 ============================== end predicate elimination =============
% 2.15/2.40
% 2.15/2.40 Auto_denials:
% 2.15/2.40 % copying label prove_AD to answer in negative clause
% 2.15/2.40
% 2.15/2.40 Term ordering decisions:
% 2.15/2.40 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.15/2.40
% 2.15/2.40 ============================== end of process initial clauses ========
% 2.15/2.40
% 2.15/2.40 ============================== CLAUSES FOR SEARCH ====================
% 2.15/2.40
% 2.15/2.40 ============================== end of clauses for search =============
% 2.15/2.40
% 2.15/2.40 ============================== SEARCH ================================
% 2.15/2.40
% 2.15/2.40 % Starting search at 0.01 seconds.
% 2.15/2.40
% 2.15/2.40 Low Water (keep): wt=15.000, iters=3381
% 2.15/2.40
% 2.15/2.40 Low Water (keep): wt=14.000, iters=3358
% 2.15/2.40
% 2.15/2.40 Low Water (keep): wt=13.000, iters=3339
% 2.15/2.40
% 2.15/2.40 Low Water (keep): wt=12.000, iters=3350
% 2.15/2.40
% 2.15/2.40 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 166 (0.00 of 0.34 sec).
% 2.15/2.40
% 2.15/2.40 ============================== PROOF =================================
% 2.15/2.40 % SZS status Unsatisfiable
% 2.15/2.40 % SZS output start Refutation
% 2.15/2.40
% 2.15/2.40 % Proof 1 at 1.22 (+ 0.21) seconds: prove_AD.
% 2.15/2.40 % Length of proof is 36.
% 2.15/2.40 % Level of proof is 9.
% 2.15/2.40 % Maximum clause weight is 22.000.
% 2.15/2.40 % Given clauses 1432.
% 2.15/2.40
% 2.15/2.40 1 differ(a,b) # label(differ_a_b) # label(axiom). [assumption].
% 2.15/2.40 2 differ(a,c) # label(differ_a_c) # label(axiom). [assumption].
% 2.15/2.40 3 differ(a,d) # label(differ_a_d) # label(axiom). [assumption].
% 2.15/2.40 4 differ(a,table) # label(differ_a_table) # label(axiom). [assumption].
% 2.15/2.40 5 differ(b,c) # label(differ_b_c) # label(axiom). [assumption].
% 2.15/2.40 6 differ(b,d) # label(differ_b_d) # label(axiom). [assumption].
% 2.15/2.40 9 differ(c,table) # label(differ_c_table) # label(axiom). [assumption].
% 2.15/2.40 11 holds(empty,s0) # label(initial_state8) # label(axiom). [assumption].
% 2.15/2.40 12 holds(clear(a),s0) # label(initial_state5) # label(axiom). [assumption].
% 2.15/2.40 13 holds(clear(b),s0) # label(initial_state6) # label(axiom). [assumption].
% 2.15/2.40 14 holds(clear(c),s0) # label(initial_state7) # label(axiom). [assumption].
% 2.15/2.40 18 holds(on(c,d),s0) # label(initial_state3) # label(axiom). [assumption].
% 2.15/2.40 20 -holds(on(a,d),A) # label(prove_AD) # label(negated_conjecture) # answer(prove_AD). [assumption].
% 2.15/2.40 21 differ(A,B) | -differ(B,A) # label(symmetry_of_differ) # label(axiom). [assumption].
% 2.15/2.40 23 holds(clear(A),do(pickup(B),C)) | -holds(clear(A),C) | -differ(A,B) # label(pickup_4) # label(axiom). [assumption].
% 2.15/2.40 25 holds(empty,do(putdown(A,B),C)) | -holds(holding(A),C) | -holds(clear(B),C) # label(putdown_1) # label(axiom). [assumption].
% 2.15/2.40 26 holds(clear(A),do(putdown(B,C),D)) | -holds(clear(A),D) | -differ(A,C) # label(putdown_5) # label(axiom). [assumption].
% 2.15/2.40 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.15/2.40 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.15/2.40 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.15/2.40 36 differ(d,b). [ur(21,b,6,a)].
% 2.15/2.40 127 holds(clear(b),do(pickup(c),s0)). [ur(23,b,13,a,c,5,a)].
% 2.15/2.40 130 holds(clear(a),do(pickup(c),s0)). [ur(23,b,12,a,c,2,a)].
% 2.15/2.40 155 holds(holding(c),do(pickup(c),s0)). [ur(29,b,11,a,c,14,a,d,9,a)].
% 2.15/2.40 158 -holds(holding(a),A) | -holds(clear(d),A) # answer(prove_AD). [resolve(30,a,20,a)].
% 2.15/2.40 159 holds(clear(d),do(pickup(c),s0)). [ur(31,b,18,a,c,14,a,d,11,a)].
% 2.15/2.40 164 -holds(holding(a),do(pickup(A),B)) | -holds(clear(d),B) | -differ(d,A) # answer(prove_AD). [resolve(158,b,23,a)].
% 2.15/2.40 170 -holds(holding(a),do(pickup(A),B)) | -holds(clear(d),B) | -differ(A,d) # answer(prove_AD). [resolve(164,c,21,a)].
% 2.15/2.40 183 -holds(holding(a),do(pickup(a),A)) | -holds(clear(d),A) # answer(prove_AD). [resolve(170,c,3,a)].
% 2.15/2.40 197 -holds(clear(d),A) | -holds(empty,A) | -holds(clear(a),A) | -differ(a,table) # answer(prove_AD). [resolve(183,a,29,a)].
% 2.15/2.40 214 -holds(clear(d),A) | -holds(empty,A) | -holds(clear(a),A) # answer(prove_AD). [resolve(197,d,4,a)].
% 2.15/2.40 249 -holds(clear(d),do(putdown(A,B),C)) | -holds(empty,do(putdown(A,B),C)) | -holds(clear(a),C) | -differ(a,B) # answer(prove_AD). [resolve(214,c,26,a)].
% 2.15/2.40 3291 holds(empty,do(putdown(c,b),do(pickup(c),s0))). [ur(25,b,155,a,c,127,a)].
% 2.15/2.40 3474 holds(clear(d),do(putdown(A,b),do(pickup(c),s0))). [ur(26,b,159,a,c,36,a)].
% 2.15/2.40 9025 -holds(clear(d),do(putdown(c,b),do(pickup(c),s0))) # answer(prove_AD). [ur(249,b,3291,a,c,130,a,d,1,a)].
% 2.15/2.40 9026 $F # answer(prove_AD). [resolve(9025,a,3474,a)].
% 2.15/2.40
% 2.15/2.40 % SZS output end Refutation
% 2.15/2.40 ============================== end of proof ==========================
% 2.15/2.40
% 2.15/2.40 ============================== STATISTICS ============================
% 2.15/2.40
% 2.15/2.40 Given=1432. Generated=375694. Kept=9025. proofs=1.
% 2.15/2.40 Usable=1419. Sos=7543. Demods=0. Limbo=23, Disabled=70. Hints=0.
% 2.15/2.40 Megabytes=7.54.
% 2.15/2.40 User_CPU=1.22, System_CPU=0.21, Wall_clock=1.
% 2.15/2.40
% 2.15/2.40 ============================== end of statistics =====================
% 2.15/2.40
% 2.15/2.40 ============================== end of search =========================
% 2.15/2.40
% 2.15/2.40 THEOREM PROVED
% 2.15/2.40 % SZS status Unsatisfiable
% 2.15/2.40
% 2.15/2.40 Exiting with 1 proof.
% 2.15/2.40
% 2.15/2.40 Process 29157 exit (max_proofs) Tue May 31 21:50:53 2022
% 2.15/2.40 Prover9 interrupted
%------------------------------------------------------------------------------