TSTP Solution File: MSC002-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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 : 300s
% DateTime : Wed Jul 27 13:06:17 EDT 2022
% Result : Unsatisfiable 1.95s 2.12s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 18 ( 11 unt; 1 nHn; 13 RR)
% Number of literals : 28 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ held(A,let_go(B)),
file('MSC002-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ at(A,here,B)
| red(A) ),
file('MSC002-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ at(A,B,C)
| at(A,B,let_go(C)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ at(A,B,C)
| at(A,B,pick_up(C)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ at(A,B,C)
| grabbed(A,pick_up(go(B,let_go(C)))) ),
file('MSC002-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ red(A)
| ~ put(A,there,B)
| answer(B) ),
file('MSC002-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ at(A,B,C)
| ~ grabbed(A,C)
| put(A,D,go(D,C)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(10,axiom,
( held(A,B)
| ~ at(A,C,B)
| at(A,C,go(D,B)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(13,axiom,
~ answer(A),
file('MSC002-1.p',unknown),
[] ).
cnf(14,axiom,
at(something,here,now),
file('MSC002-1.p',unknown),
[] ).
cnf(16,plain,
grabbed(something,pick_up(go(here,let_go(now)))),
inference(hyper,[status(thm)],[14,7]),
[iquote('hyper,14,7')] ).
cnf(18,plain,
at(something,here,let_go(now)),
inference(hyper,[status(thm)],[14,5]),
[iquote('hyper,14,5')] ).
cnf(19,plain,
red(something),
inference(hyper,[status(thm)],[14,4]),
[iquote('hyper,14,4')] ).
cnf(24,plain,
at(something,here,go(A,let_go(now))),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[18,10]),3]),
[iquote('hyper,18,10,unit_del,3')] ).
cnf(46,plain,
at(something,here,pick_up(go(A,let_go(now)))),
inference(hyper,[status(thm)],[24,6]),
[iquote('hyper,24,6')] ).
cnf(89,plain,
put(something,A,go(A,pick_up(go(here,let_go(now))))),
inference(hyper,[status(thm)],[46,9,16]),
[iquote('hyper,46,9,16')] ).
cnf(339,plain,
answer(go(there,pick_up(go(here,let_go(now))))),
inference(hyper,[status(thm)],[89,8,19]),
[iquote('hyper,89,8,19')] ).
cnf(340,plain,
$false,
inference(binary,[status(thm)],[339,13]),
[iquote('binary,339.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 09:07:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox2 on n025.cluster.edu,
% 1.95/2.12 Wed Jul 27 09:07:45 2022
% 1.95/2.12 The command was "./otter". The process ID is 21435.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] at(something,here,now).
% 1.95/2.12 0 [] -hand_at(Place,Situation)|hand_at(Place,let_go(Situation)).
% 1.95/2.12 0 [] -hand_at(Place,Situation)|hand_at(Another_place,go(Another_place,Situation)).
% 1.95/2.12 0 [] -held(Thing,let_go(Situation)).
% 1.95/2.12 0 [] -at(Thing,here,Situation)|red(Thing).
% 1.95/2.12 0 [] -at(Thing,Place,Situation)|at(Thing,Place,let_go(Situation)).
% 1.95/2.12 0 [] -at(Thing,Place,Situation)|at(Thing,Place,pick_up(Situation)).
% 1.95/2.12 0 [] -at(Thing,Place,Situation)|grabbed(Thing,pick_up(go(Place,let_go(Situation)))).
% 1.95/2.12 0 [] -red(Thing)| -put(Thing,there,Situation)|answer(Situation).
% 1.95/2.12 0 [] -at(Thing,Place,Situation)| -grabbed(Thing,Situation)|put(Thing,Another_place,go(Another_place,Situation)).
% 1.95/2.12 0 [] held(Thing,Situation)| -at(Thing,Place,Situation)|at(Thing,Place,go(Another_place,Situation)).
% 1.95/2.12 0 [] -hand_at(One_place,Situation)| -held(Thing,Situation)|at(Thing,Place,go(Place,Situation)).
% 1.95/2.12 0 [] -hand_at(Place,Situation)| -at(Thing,Place,Situation)|held(Thing,pick_up(Situation)).
% 1.95/2.12 0 [] -answer(Situation).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.95/2.12
% 1.95/2.12 This is a non-Horn set without equality. The strategy will
% 1.95/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.95/2.12 satellites in sos and with nuclei in usable.
% 1.95/2.12
% 1.95/2.12 dependent: set(hyper_res).
% 1.95/2.12 dependent: set(factor).
% 1.95/2.12 dependent: set(unit_deletion).
% 1.95/2.12
% 1.95/2.12 ------------> process usable:
% 1.95/2.12 ** KEPT (pick-wt=7): 1 [] -hand_at(A,B)|hand_at(A,let_go(B)).
% 1.95/2.12 ** KEPT (pick-wt=8): 2 [] -hand_at(A,B)|hand_at(C,go(C,B)).
% 1.95/2.12 ** KEPT (pick-wt=4): 3 [] -held(A,let_go(B)).
% 1.95/2.12 ** KEPT (pick-wt=6): 4 [] -at(A,here,B)|red(A).
% 1.95/2.12 ** KEPT (pick-wt=9): 5 [] -at(A,B,C)|at(A,B,let_go(C)).
% 1.95/2.12 ** KEPT (pick-wt=9): 6 [] -at(A,B,C)|at(A,B,pick_up(C)).
% 1.95/2.12 ** KEPT (pick-wt=11): 7 [] -at(A,B,C)|grabbed(A,pick_up(go(B,let_go(C)))).
% 1.95/2.12 ** KEPT (pick-wt=8): 8 [] -red(A)| -put(A,there,B)|answer(B).
% 1.95/2.12 ** KEPT (pick-wt=13): 9 [] -at(A,B,C)| -grabbed(A,C)|put(A,D,go(D,C)).
% 1.95/2.12 ** KEPT (pick-wt=13): 10 [] held(A,B)| -at(A,C,B)|at(A,C,go(D,B)).
% 1.95/2.12 ** KEPT (pick-wt=12): 11 [] -hand_at(A,B)| -held(C,B)|at(C,D,go(D,B)).
% 1.95/2.12 ** KEPT (pick-wt=11): 12 [] -hand_at(A,B)| -at(C,A,B)|held(C,pick_up(B)).
% 1.95/2.12 ** KEPT (pick-wt=2): 13 [] -answer(A).
% 1.95/2.12
% 1.95/2.12 ------------> process sos:
% 1.95/2.12 ** KEPT (pick-wt=4): 14 [] at(something,here,now).
% 1.95/2.12
% 1.95/2.12 ======= end of input processing =======
% 1.95/2.12
% 1.95/2.12 =========== start of search ===========
% 1.95/2.12
% 1.95/2.12 -------- PROOF --------
% 1.95/2.12
% 1.95/2.12 ----> UNIT CONFLICT at 0.01 sec ----> 340 [binary,339.1,13.1] $F.
% 1.95/2.12
% 1.95/2.12 Length of proof is 7. Level of proof is 5.
% 1.95/2.12
% 1.95/2.12 ---------------- PROOF ----------------
% 1.95/2.12 % SZS status Unsatisfiable
% 1.95/2.12 % SZS output start Refutation
% See solution above
% 1.95/2.12 ------------ end of proof -------------
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12 ============ end of search ============
% 1.95/2.12
% 1.95/2.12 -------------- statistics -------------
% 1.95/2.12 clauses given 107
% 1.95/2.12 clauses generated 404
% 1.95/2.12 clauses kept 339
% 1.95/2.12 clauses forward subsumed 79
% 1.95/2.12 clauses back subsumed 0
% 1.95/2.12 Kbytes malloced 2929
% 1.95/2.12
% 1.95/2.12 ----------- times (seconds) -----------
% 1.95/2.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.95/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.12
% 1.95/2.12 That finishes the proof of the theorem.
% 1.95/2.12
% 1.95/2.12 Process 21435 finished Wed Jul 27 09:07:47 2022
% 1.95/2.12 Otter interrupted
% 1.95/2.12 PROOF FOUND
%------------------------------------------------------------------------------