TSTP Solution File: MSC001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MSC001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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 : Sun Jul 17 22:56:28 EDT 2022
% Result : Unsatisfiable 0.45s 1.01s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 16:23:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/1.01 ============================== Prover9 ===============================
% 0.45/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01 Process 17914 was started by sandbox2 on n004.cluster.edu,
% 0.45/1.01 Fri Jul 1 16:23:23 2022
% 0.45/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17672_n004.cluster.edu".
% 0.45/1.01 ============================== end of head ===========================
% 0.45/1.01
% 0.45/1.01 ============================== INPUT =================================
% 0.45/1.01
% 0.45/1.01 % Reading from file /tmp/Prover9_17672_n004.cluster.edu
% 0.45/1.01
% 0.45/1.01 set(prolog_style_variables).
% 0.45/1.01 set(auto2).
% 0.45/1.01 % set(auto2) -> set(auto).
% 0.45/1.01 % set(auto) -> set(auto_inference).
% 0.45/1.01 % set(auto) -> set(auto_setup).
% 0.45/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01 % set(auto) -> set(auto_limits).
% 0.45/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01 % set(auto) -> set(auto_denials).
% 0.45/1.01 % set(auto) -> set(auto_process).
% 0.45/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01 % set(auto2) -> assign(stats, some).
% 0.45/1.01 % set(auto2) -> clear(echo_input).
% 0.45/1.01 % set(auto2) -> set(quiet).
% 0.45/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01 % set(auto2) -> clear(print_given).
% 0.45/1.01 assign(lrs_ticks,-1).
% 0.45/1.01 assign(sos_limit,10000).
% 0.45/1.01 assign(order,kbo).
% 0.45/1.01 set(lex_order_vars).
% 0.45/1.01 clear(print_given).
% 0.45/1.01
% 0.45/1.01 % formulas(sos). % not echoed (18 formulas)
% 0.45/1.01
% 0.45/1.01 ============================== end of input ==========================
% 0.45/1.01
% 0.45/1.01 % From the command line: assign(max_seconds, 300).
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01
% 0.45/1.01 % Formulas that are not ordinary clauses:
% 0.45/1.01
% 0.45/1.01 ============================== end of process non-clausal formulas ===
% 0.45/1.01
% 0.45/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01
% 0.45/1.01 ============================== PREDICATE ELIMINATION =================
% 0.45/1.01 1 -at(A,here,now) | red(A) # label(things_here_now_are_red) # label(hypothesis). [assumption].
% 0.45/1.01 2 -red(hand) # label(clause_3) # label(axiom). [assumption].
% 0.45/1.01 Derived: -at(hand,here,now). [resolve(1,b,2,a)].
% 0.45/1.01 3 -red(A) | -at(A,there,B) | answer(B) # label(clause_11) # label(axiom). [assumption].
% 0.45/1.01 Derived: -at(A,there,B) | answer(B) | -at(A,here,now). [resolve(3,a,1,b)].
% 0.45/1.01 4 -at(A,there,B) | answer(B) | -at(A,here,now). [resolve(3,a,1,b)].
% 0.45/1.01 5 -answer(A) # label(prove_there_is_a_red_thing) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -at(A,there,B) | -at(A,here,now). [resolve(4,b,5,a)].
% 0.45/1.01
% 0.45/1.01 ============================== end predicate elimination =============
% 0.45/1.01
% 0.45/1.01 Auto_denials: (non-Horn, no changes).
% 0.45/1.01
% 0.45/1.01 Term ordering decisions:
% 0.45/1.01 Function symbol KB weights: hand=1. let_go=1. pick_up=1. here=1. now=1. s=1. there=1. do=1. thing=1. go=1. taken=1.
% 0.45/1.01
% 0.45/1.01 ============================== end of process initial clauses ========
% 0.45/1.01
% 0.45/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.01
% 0.45/1.01 ============================== end of clauses for search =============
% 0.45/1.01
% 0.45/1.01 ============================== SEARCH ================================
% 0.45/1.01
% 0.45/1.01 % Starting search at 0.01 seconds.
% 0.45/1.01
% 0.45/1.01 ============================== PROOF =================================
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01 % SZS output start Refutation
% 0.45/1.01
% 0.45/1.01 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.45/1.01 % Length of proof is 22.
% 0.45/1.01 % Level of proof is 6.
% 0.45/1.01 % Maximum clause weight is 17.000.
% 0.45/1.01 % Given clauses 82.
% 0.45/1.01
% 0.45/1.01 1 -at(A,here,now) | red(A) # label(things_here_now_are_red) # label(hypothesis). [assumption].
% 0.45/1.01 3 -red(A) | -at(A,there,B) | answer(B) # label(clause_11) # label(axiom). [assumption].
% 0.45/1.01 4 -at(A,there,B) | answer(B) | -at(A,here,now). [resolve(3,a,1,b)].
% 0.45/1.01 5 -answer(A) # label(prove_there_is_a_red_thing) # label(negated_conjecture). [assumption].
% 0.45/1.01 7 at(hand,A,do(go(A),B)) # label(clause_5) # label(axiom). [assumption].
% 0.45/1.01 8 -hold(thing(A),do(let_go,B)) # label(clause_2) # label(axiom). [assumption].
% 0.45/1.01 10 -at(hand,A,B) | at(thing(taken(B)),A,B) # label(clause_14) # label(axiom). [assumption].
% 0.45/1.01 13 -at(A,B,do(let_go,C)) | at(A,B,C) # label(clause_17) # label(axiom). [assumption].
% 0.45/1.01 14 -hold(thing(A),B) | hold(thing(A),do(go(C),B)) # label(clause_13) # label(axiom). [assumption].
% 0.45/1.01 15 -hold(thing(A),B) | -at(hand,C,B) | at(thing(A),C,B) # label(clause_9) # label(axiom). [assumption].
% 0.45/1.01 18 -at(hand,A,B) | -at(thing(C),A,B) | hold(thing(taken(B)),do(pick_up,B)) # label(clause_8) # label(axiom). [assumption].
% 0.45/1.01 19 -at(thing(A),B,do(go(B),C)) | at(thing(A),B,C) | hold(thing(A),C) # label(clause_7) # label(axiom). [assumption].
% 0.45/1.01 21 -at(A,there,B) | -at(A,here,now). [resolve(4,b,5,a)].
% 0.45/1.01 25 at(thing(taken(do(go(A),B))),A,do(go(A),B)). [resolve(10,a,7,a)].
% 0.45/1.01 30 -hold(thing(A),do(go(B),C)) | at(thing(A),B,do(go(B),C)). [resolve(15,b,7,a)].
% 0.45/1.01 59 at(thing(taken(do(go(A),B))),A,B) | hold(thing(taken(do(go(A),B))),B). [resolve(25,a,19,a)].
% 0.45/1.01 60 hold(thing(taken(do(go(A),B))),do(pick_up,do(go(A),B))). [resolve(25,a,18,b),unit_del(a,7)].
% 0.45/1.01 172 at(thing(taken(do(go(A),do(let_go,B)))),A,B). [resolve(59,a,13,a),unit_del(a,8)].
% 0.45/1.01 188 -at(thing(taken(do(go(here),do(let_go,now)))),there,A). [resolve(172,a,21,b)].
% 0.45/1.01 212 hold(thing(taken(do(go(A),B))),do(go(C),do(pick_up,do(go(A),B)))). [resolve(60,a,14,a)].
% 0.45/1.01 216 -hold(thing(taken(do(go(here),do(let_go,now)))),do(go(there),A)). [ur(30,b,188,a)].
% 0.45/1.01 217 $F. [resolve(216,a,212,a)].
% 0.45/1.01
% 0.45/1.01 % SZS output end Refutation
% 0.45/1.01 ============================== end of proof ==========================
% 0.45/1.01
% 0.45/1.01 ============================== STATISTICS ============================
% 0.45/1.01
% 0.45/1.01 Given=82. Generated=372. Kept=211. proofs=1.
% 0.45/1.01 Usable=78. Sos=110. Demods=0. Limbo=1, Disabled=42. Hints=0.
% 0.45/1.01 Megabytes=0.21.
% 0.45/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.45/1.01
% 0.45/1.01 ============================== end of statistics =====================
% 0.45/1.01
% 0.45/1.01 ============================== end of search =========================
% 0.45/1.01
% 0.45/1.01 THEOREM PROVED
% 0.45/1.01 % SZS status Unsatisfiable
% 0.45/1.01
% 0.45/1.01 Exiting with 1 proof.
% 0.45/1.01
% 0.45/1.01 Process 17914 exit (max_proofs) Fri Jul 1 16:23:23 2022
% 0.45/1.01 Prover9 interrupted
%------------------------------------------------------------------------------