%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MSC001-1 : 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 : n004.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:15 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.42s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 34 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 12 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_there_is_a_red_thing,axiom,
! [VAR_0] : ~ answer(VAR_0),
file('theBenchmark.p',prove_there_is_a_red_thing) ).
cnf(c_1,plain,
~ answer(A),
inference(clausify,[status(thm)],[prove_there_is_a_red_thing]) ).
fof(clause_11,axiom,
! [VAR_0,VAR_1] :
( answer(VAR_1)
| ~ at(VAR_0,there,VAR_1)
| ~ red(VAR_0) ),
file('theBenchmark.p',clause_11) ).
cnf(c_2,plain,
( answer(B)
| ~ at(A,there,B)
| ~ red(A) ),
inference(clausify,[status(thm)],[clause_11]) ).
fof(things_here_now_are_red,axiom,
! [VAR_0] :
( red(VAR_0)
| ~ at(VAR_0,here,now) ),
file('theBenchmark.p',things_here_now_are_red) ).
cnf(c_3,plain,
( red(A)
| ~ at(A,here,now) ),
inference(clausify,[status(thm)],[things_here_now_are_red]) ).
cnf(c_4,plain,
( ~ at(A,there,B)
| ~ red(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_7,plain,
( ~ at(A,there,B)
| ~ at(A,here,now) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
fof(clause_2,axiom,
! [VAR_0,VAR_1] : ~ hold(thing(VAR_0),do(let_go,VAR_1)),
file('theBenchmark.p',clause_2) ).
cnf(c_9,plain,
~ hold(thing(A),do(let_go,B)),
inference(clausify,[status(thm)],[clause_2]) ).
fof(clause_5,axiom,
! [VAR_0,VAR_1] : at(hand,VAR_0,do(go(VAR_0),VAR_1)),
file('theBenchmark.p',clause_5) ).
cnf(c_10,plain,
at(hand,A,do(go(A),B)),
inference(clausify,[status(thm)],[clause_5]) ).
fof(clause_7,axiom,
! [VAR_0,VAR_1,VAR_2] :
( hold(thing(VAR_0),VAR_2)
| at(thing(VAR_0),VAR_1,VAR_2)
| ~ at(thing(VAR_0),VAR_1,do(go(VAR_1),VAR_2)) ),
file('theBenchmark.p',clause_7) ).
cnf(c_12,plain,
( hold(thing(A),C)
| at(thing(A),B,C)
| ~ at(thing(A),B,do(go(B),C)) ),
inference(clausify,[status(thm)],[clause_7]) ).
fof(clause_8,axiom,
! [VAR_0,VAR_1,VAR_2] :
( hold(thing(taken(VAR_1)),do(pick_up,VAR_1))
| ~ at(thing(VAR_2),VAR_0,VAR_1)
| ~ at(hand,VAR_0,VAR_1) ),
file('theBenchmark.p',clause_8) ).
cnf(c_13,plain,
( hold(thing(taken(B)),do(pick_up,B))
| ~ at(thing(C),A,B)
| ~ at(hand,A,B) ),
inference(clausify,[status(thm)],[clause_8]) ).
fof(clause_9,axiom,
! [VAR_0,VAR_1,VAR_2] :
( at(thing(VAR_0),VAR_2,VAR_1)
| ~ at(hand,VAR_2,VAR_1)
| ~ hold(thing(VAR_0),VAR_1) ),
file('theBenchmark.p',clause_9) ).
cnf(c_14,plain,
( at(thing(A),C,B)
| ~ at(hand,C,B)
| ~ hold(thing(A),B) ),
inference(clausify,[status(thm)],[clause_9]) ).
fof(clause_13,axiom,
! [VAR_0,VAR_1,VAR_2] :
( hold(thing(VAR_0),do(go(VAR_2),VAR_1))
| ~ hold(thing(VAR_0),VAR_1) ),
file('theBenchmark.p',clause_13) ).
cnf(c_17,plain,
( hold(thing(A),do(go(C),B))
| ~ hold(thing(A),B) ),
inference(clausify,[status(thm)],[clause_13]) ).
fof(clause_14,axiom,
! [VAR_0,VAR_1] :
( at(thing(taken(VAR_1)),VAR_0,VAR_1)
| ~ at(hand,VAR_0,VAR_1) ),
file('theBenchmark.p',clause_14) ).
cnf(c_18,plain,
( at(thing(taken(B)),A,B)
| ~ at(hand,A,B) ),
inference(clausify,[status(thm)],[clause_14]) ).
fof(clause_17,axiom,
! [VAR_0,VAR_1,VAR_2] :
( at(VAR_0,VAR_1,VAR_2)
| ~ at(VAR_0,VAR_1,do(let_go,VAR_2)) ),
file('theBenchmark.p',clause_17) ).
cnf(c_21,plain,
( at(A,B,C)
| ~ at(A,B,do(let_go,C)) ),
inference(clausify,[status(thm)],[clause_17]) ).
cnf(c_26,plain,
( hold(thing(taken(do(go(B),C))),do(pick_up,do(go(B),C)))
| ~ at(thing(A),B,do(go(B),C)) ),
inference(resolve,[status(thm)],[c_13,c_10]) ).
cnf(c_27,plain,
( at(thing(A),B,do(go(B),C))
| ~ hold(thing(A),do(go(B),C)) ),
inference(resolve,[status(thm)],[c_14,c_10]) ).
cnf(c_30,plain,
at(thing(taken(do(go(A),B))),A,do(go(A),B)),
inference(resolve,[status(thm)],[c_18,c_10]) ).
cnf(c_61,plain,
hold(thing(taken(do(go(A),B))),do(pick_up,do(go(A),B))),
inference(resolve,[status(thm)],[c_30,c_26]) ).
cnf(c_65,plain,
( hold(thing(taken(do(go(A),B))),B)
| at(thing(taken(do(go(A),B))),A,B) ),
inference(resolve,[status(thm)],[c_30,c_12]) ).
cnf(c_204,plain,
( at(thing(taken(do(go(A),do(let_go,B)))),A,B)
| hold(thing(taken(do(go(A),do(let_go,B)))),do(let_go,B)) ),
inference(resolve,[status(thm)],[c_65,c_21]) ).
cnf(c_158,plain,
at(thing(taken(do(go(A),do(let_go,B)))),A,B),
inference(resolve,[status(thm)],[c_9,c_204]) ).
cnf(c_175,plain,
~ at(thing(taken(do(go(here),do(let_go,now)))),there,A),
inference(resolve,[status(thm)],[c_158,c_7]) ).
cnf(c_181,plain,
hold(thing(taken(do(go(A),B))),do(go(C),do(pick_up,do(go(A),B)))),
inference(resolve,[status(thm)],[c_61,c_17]) ).
cnf(c_202,plain,
~ hold(thing(taken(do(go(here),do(let_go,now)))),do(go(there),A)),
inference(resolve,[status(thm)],[c_27,c_175]) ).
cnf(c_203,plain,
$false,
inference(resolve,[status(thm)],[c_202,c_181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 00:14:37 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 318100 was started by sandbox2 on n004,
% 0.09/0.37 % Sat Sep 26 00:14:37 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.42
% 0.09/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.42
% 0.09/0.42 % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.09/0.42 % Length of proof is 23.
% 0.09/0.42 % Level of proof is 6.
% 0.09/0.42 % Maximum clause weight is 51.000.
% 0.09/0.42 % Given clauses 75.
% 0.09/0.42
% 0.09/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------