TSTP Solution File: PLA002-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:10:44 EDT 2022
% Result : Unsatisfiable 1.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 7 unt; 3 nHn; 13 RR)
% Number of literals : 25 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ at(b,A)
| at(a,drive(a,A)) ),
file('PLA002-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cold(A)
| ~ at(c,A)
| at(b,skate(b,A)) ),
file('PLA002-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ warm(A)
| ~ at(d,A)
| at(b,climb(b,A)) ),
file('PLA002-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ at(d,A)
| at(c,go(c,A)) ),
file('PLA002-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ at(f,A)
| at(d,go(d,A)) ),
file('PLA002-1.p',unknown),
[] ).
cnf(15,axiom,
~ at(a,A),
file('PLA002-1.p',unknown),
[] ).
cnf(16,axiom,
( warm(A)
| cold(B) ),
file('PLA002-1.p',unknown),
[] ).
cnf(17,axiom,
at(f,s0),
file('PLA002-1.p',unknown),
[] ).
cnf(18,plain,
at(d,go(d,s0)),
inference(hyper,[status(thm)],[17,14]),
[iquote('hyper,17,14')] ).
cnf(20,plain,
at(c,go(c,go(d,s0))),
inference(hyper,[status(thm)],[18,10]),
[iquote('hyper,18,10')] ).
cnf(21,plain,
( at(b,climb(b,go(d,s0)))
| cold(A) ),
inference(hyper,[status(thm)],[18,8,16]),
[iquote('hyper,18,8,16')] ).
cnf(25,plain,
( at(b,climb(b,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(hyper,[status(thm)],[21,6,20]),
[iquote('hyper,21,6,20')] ).
cnf(37,plain,
at(b,climb(b,go(d,s0))),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[25,4]),15]),
[iquote('hyper,25,4,unit_del,15')] ).
cnf(39,plain,
at(a,drive(a,climb(b,go(d,s0)))),
inference(hyper,[status(thm)],[37,4]),
[iquote('hyper,37,4')] ).
cnf(40,plain,
$false,
inference(binary,[status(thm)],[39,15]),
[iquote('binary,39.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:25:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox on n012.cluster.edu,
% 1.67/1.88 Wed Jul 27 02:25:50 2022
% 1.67/1.88 The command was "./otter". The process ID is 11278.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] warm(Situation1)|cold(Situation2).
% 1.67/1.88 0 [] -at(a,Situation)|at(b,walk(b,Situation)).
% 1.67/1.88 0 [] -at(a,Situation)|at(b,drive(b,Situation)).
% 1.67/1.88 0 [] -at(b,Situation)|at(a,walk(a,Situation)).
% 1.67/1.88 0 [] -at(b,Situation)|at(a,drive(a,Situation)).
% 1.67/1.88 0 [] -cold(Situation)| -at(b,Situation)|at(c,skate(c,Situation)).
% 1.67/1.88 0 [] -cold(Situation)| -at(c,Situation)|at(b,skate(b,Situation)).
% 1.67/1.88 0 [] -warm(Situation)| -at(b,Situation)|at(d,climb(d,Situation)).
% 1.67/1.88 0 [] -warm(Situation)| -at(d,Situation)|at(b,climb(b,Situation)).
% 1.67/1.88 0 [] -at(c,Situation)|at(d,go(d,Situation)).
% 1.67/1.88 0 [] -at(d,Situation)|at(c,go(c,Situation)).
% 1.67/1.88 0 [] -at(c,Situation)|at(e,go(e,Situation)).
% 1.67/1.88 0 [] -at(e,Situation)|at(c,go(c,Situation)).
% 1.67/1.88 0 [] -at(d,Situation)|at(f,go(f,Situation)).
% 1.67/1.88 0 [] -at(f,Situation)|at(d,go(d,Situation)).
% 1.67/1.88 0 [] at(f,s0).
% 1.67/1.88 0 [] -at(a,S).
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.67/1.88
% 1.67/1.88 This is a non-Horn set without equality. The strategy will
% 1.67/1.88 be ordered hyper_res, unit deletion, and factoring, with
% 1.67/1.88 satellites in sos and with nuclei in usable.
% 1.67/1.88
% 1.67/1.88 dependent: set(hyper_res).
% 1.67/1.88 dependent: set(factor).
% 1.67/1.88 dependent: set(unit_deletion).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=8): 1 [] -at(a,A)|at(b,walk(b,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 2 [] -at(a,A)|at(b,drive(b,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 3 [] -at(b,A)|at(a,walk(a,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 4 [] -at(b,A)|at(a,drive(a,A)).
% 1.67/1.88 ** KEPT (pick-wt=10): 5 [] -cold(A)| -at(b,A)|at(c,skate(c,A)).
% 1.67/1.88 ** KEPT (pick-wt=10): 6 [] -cold(A)| -at(c,A)|at(b,skate(b,A)).
% 1.67/1.88 ** KEPT (pick-wt=10): 7 [] -warm(A)| -at(b,A)|at(d,climb(d,A)).
% 1.67/1.88 ** KEPT (pick-wt=10): 8 [] -warm(A)| -at(d,A)|at(b,climb(b,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 9 [] -at(c,A)|at(d,go(d,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 10 [] -at(d,A)|at(c,go(c,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 11 [] -at(c,A)|at(e,go(e,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 12 [] -at(e,A)|at(c,go(c,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 13 [] -at(d,A)|at(f,go(f,A)).
% 1.67/1.88 ** KEPT (pick-wt=8): 14 [] -at(f,A)|at(d,go(d,A)).
% 1.67/1.88 ** KEPT (pick-wt=3): 15 [] -at(a,A).
% 1.67/1.88 15 back subsumes 2.
% 1.67/1.88 15 back subsumes 1.
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=4): 16 [] warm(A)|cold(B).
% 1.67/1.88 ** KEPT (pick-wt=3): 17 [] at(f,s0).
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 ----> UNIT CONFLICT at 0.00 sec ----> 40 [binary,39.1,15.1] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 6. Level of proof is 5.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Unsatisfiable
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 12
% 1.67/1.88 clauses generated 26
% 1.67/1.88 clauses kept 39
% 1.67/1.88 clauses forward subsumed 4
% 1.67/1.88 clauses back subsumed 6
% 1.67/1.88 Kbytes malloced 976
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 11278 finished Wed Jul 27 02:25:52 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------