TSTP Solution File: MSC002-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:59:27 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 5 unt; 3 nHn; 20 RR)
% Number of literals : 45 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
at(something,here,now),
file('MSC002-1.p',unknown),
[] ).
cnf(4,axiom,
~ held(u,let_go(v)),
file('MSC002-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ at(u,here,v)
| red(u) ),
file('MSC002-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ at(u,v,w)
| at(u,v,let_go(w)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ at(u,v,w)
| at(u,v,pick_up(w)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ at(u,v,w)
| grabbed(u,pick_up(go(v,let_go(w)))) ),
file('MSC002-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ red(u)
| ~ put(u,there,v)
| answer(v) ),
file('MSC002-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ grabbed(u,v)
| ~ at(u,w,v)
| put(u,x,go(x,v)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ at(u,v,w)
| held(u,w)
| at(u,v,go(x,w)) ),
file('MSC002-1.p',unknown),
[] ).
cnf(14,axiom,
~ answer(u),
file('MSC002-1.p',unknown),
[] ).
cnf(15,plain,
( ~ red(u)
| ~ put(u,there,v) ),
inference(mrr,[status(thm)],[9,14]),
[iquote('0:MRR:9.2,14.0')] ).
cnf(43,plain,
( ~ at(u,v,w)
| ~ grabbed(u,pick_up(w))
| put(u,x,go(x,pick_up(w))) ),
inference(res,[status(thm),theory(equality)],[7,10]),
[iquote('0:Res:7.1,10.1')] ).
cnf(52,plain,
( ~ at(u,v,w)
| ~ grabbed(u,pick_up(go(x,w)))
| held(u,w)
| put(u,y,go(y,pick_up(go(x,w)))) ),
inference(res,[status(thm),theory(equality)],[11,43]),
[iquote('0:Res:11.2,43.0')] ).
cnf(105,plain,
( ~ at(u,v,w)
| ~ at(u,x,let_go(w))
| held(u,let_go(w))
| put(u,y,go(y,pick_up(go(v,let_go(w))))) ),
inference(res,[status(thm),theory(equality)],[8,52]),
[iquote('0:Res:8.1,52.1')] ).
cnf(106,plain,
( ~ at(u,v,w)
| ~ at(u,x,let_go(w))
| put(u,y,go(y,pick_up(go(v,let_go(w))))) ),
inference(mrr,[status(thm)],[105,4]),
[iquote('0:MRR:105.2,4.0')] ).
cnf(124,plain,
( ~ at(u,v,w)
| ~ at(u,x,w)
| put(u,y,go(y,pick_up(go(x,let_go(w))))) ),
inference(res,[status(thm),theory(equality)],[6,106]),
[iquote('0:Res:6.1,106.1')] ).
cnf(125,plain,
( ~ at(u,v,w)
| put(u,x,go(x,pick_up(go(v,let_go(w))))) ),
inference(con,[status(thm)],[124]),
[iquote('0:Con:124.0')] ).
cnf(126,plain,
( ~ red(u)
| ~ at(u,v,w) ),
inference(res,[status(thm),theory(equality)],[125,15]),
[iquote('0:Res:125.1,15.1')] ).
cnf(127,plain,
~ at(u,here,v),
inference(mrr,[status(thm)],[5,126]),
[iquote('0:MRR:5.1,126.0')] ).
cnf(128,plain,
$false,
inference(unc,[status(thm)],[127,1]),
[iquote('0:UnC:127.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MSC002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.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 : Fri Jul 1 15:11:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 106 clauses, backtracked 0 clauses, performed 0 splits and kept 117 clauses.
% 0.19/0.43 SPASS allocated 75777 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.04 for the input.
% 0.19/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.01 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 5, length 20 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : something_is_here_now cant_hold_and_let_go everything_is_red situation_let_go situation_pick_up can_grab_if_previously_let_go answer_if_red_and_put_there can_put_somewhere_if_grab_and_go_there thing_either_held_or_went_there prove_there_is_an_answer_situation
% 0.19/0.43
%------------------------------------------------------------------------------