%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:04:16 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.37s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 69 ( 39 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 77 ( 18 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_there_is_an_answer_situation,axiom,
! [VAR_0] : ~ answer(VAR_0),
file('theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(c_1,plain,
~ answer(A),
inference(clausify,[status(thm)],[prove_there_is_an_answer_situation]) ).
fof(answer_if_red_and_put_there,axiom,
! [VAR_0,VAR_1] :
( answer(VAR_1)
| ~ put(VAR_0,there,VAR_1)
| ~ red(VAR_0) ),
file('theBenchmark.p',answer_if_red_and_put_there) ).
cnf(c_2,plain,
( answer(B)
| ~ put(A,there,B)
| ~ red(A) ),
inference(clausify,[status(thm)],[answer_if_red_and_put_there]) ).
fof(cant_hold_and_let_go,axiom,
! [VAR_0,VAR_1] : ~ held(VAR_0,let_go(VAR_1)),
file('theBenchmark.p',cant_hold_and_let_go) ).
cnf(c_3,plain,
~ held(A,let_go(B)),
inference(clausify,[status(thm)],[cant_hold_and_let_go]) ).
fof(thing_either_held_or_went_there,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( at(VAR_0,VAR_2,go(VAR_3,VAR_1))
| ~ at(VAR_0,VAR_2,VAR_1)
| held(VAR_0,VAR_1) ),
file('theBenchmark.p',thing_either_held_or_went_there) ).
cnf(c_4,plain,
( at(A,C,go(D,B))
| ~ at(A,C,B)
| held(A,B) ),
inference(clausify,[status(thm)],[thing_either_held_or_went_there]) ).
cnf(c_5,plain,
( ~ put(A,there,B)
| ~ red(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(everything_is_red,axiom,
! [VAR_0,VAR_1] :
( red(VAR_0)
| ~ at(VAR_0,here,VAR_1) ),
file('theBenchmark.p',everything_is_red) ).
cnf(c_6,plain,
( red(A)
| ~ at(A,here,B) ),
inference(clausify,[status(thm)],[everything_is_red]) ).
fof(can_grab_if_previously_let_go,axiom,
! [VAR_0,VAR_1,VAR_2] :
( grabbed(VAR_0,pick_up(go(VAR_1,let_go(VAR_2))))
| ~ at(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(c_7,plain,
( grabbed(A,pick_up(go(B,let_go(C))))
| ~ at(A,B,C) ),
inference(clausify,[status(thm)],[can_grab_if_previously_let_go]) ).
fof(can_put_somewhere_if_grab_and_go_there,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( put(VAR_0,VAR_3,go(VAR_3,VAR_2))
| ~ grabbed(VAR_0,VAR_2)
| ~ at(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(c_8,plain,
( put(A,D,go(D,C))
| ~ grabbed(A,C)
| ~ at(A,B,C) ),
inference(clausify,[status(thm)],[can_put_somewhere_if_grab_and_go_there]) ).
cnf(c_9,plain,
( ~ at(A,here,C)
| ~ put(A,there,B) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
cnf(c_10,plain,
( put(A,E,go(E,pick_up(go(B,let_go(C)))))
| ~ at(A,D,pick_up(go(B,let_go(C))))
| ~ at(A,B,C) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_11,plain,
( ~ at(A,E,pick_up(go(C,let_go(D))))
| ~ at(A,C,D)
| ~ at(A,here,B) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
fof(situation_pick_up,axiom,
! [VAR_0,VAR_1,VAR_2] :
( at(VAR_0,VAR_1,pick_up(VAR_2))
| ~ at(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',situation_pick_up) ).
cnf(c_12,plain,
( at(A,B,pick_up(C))
| ~ at(A,B,C) ),
inference(clausify,[status(thm)],[situation_pick_up]) ).
fof(situation_let_go,axiom,
! [VAR_0,VAR_1,VAR_2] :
( at(VAR_0,VAR_1,let_go(VAR_2))
| ~ at(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',situation_let_go) ).
cnf(c_13,plain,
( at(A,B,let_go(C))
| ~ at(A,B,C) ),
inference(clausify,[status(thm)],[situation_let_go]) ).
fof(something_is_here_now,axiom,
at(something,here,now),
file('theBenchmark.p',something_is_here_now) ).
cnf(c_14,plain,
at(something,here,now),
inference(clausify,[status(thm)],[something_is_here_now]) ).
cnf(c_15,plain,
( at(A,B,go(D,let_go(C)))
| ~ at(A,B,let_go(C)) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_16,plain,
( ~ at(A,C,D)
| ~ at(A,here,E)
| ~ at(A,B,go(C,let_go(D))) ),
inference(resolve,[status(thm)],[c_12,c_11]) ).
cnf(c_21,plain,
at(something,here,let_go(now)),
inference(resolve,[status(thm)],[c_13,c_14]) ).
cnf(c_34,plain,
( ~ at(something,B,C)
| ~ at(something,A,go(B,let_go(C))) ),
inference(resolve,[status(thm)],[c_16,c_14]) ).
cnf(c_31,plain,
~ at(something,A,go(here,let_go(now))),
inference(resolve,[status(thm)],[c_34,c_14]) ).
cnf(c_32,plain,
~ at(something,A,let_go(now)),
inference(resolve,[status(thm)],[c_31,c_15]) ).
cnf(c_33,plain,
$false,
inference(resolve,[status(thm)],[c_32,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n015.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 00:17:58 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 2619628 was started by sandbox2 on n015,
% 0.08/0.35 % Sat Sep 26 00:17:58 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.08/0.37
% 0.08/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.37
% 0.08/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.37 % Length of proof is 20.
% 0.08/0.37 % Level of proof is 7.
% 0.08/0.37 % Maximum clause weight is 16.000.
% 0.08/0.37 % Given clauses 7.
% 0.08/0.37
% 0.08/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------