%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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 : Thu Sep 24 08:50:54 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.61s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 20 unt; 2 nHn; 34 RR)
% Number of literals : 58 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 24 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(something_is_here_now,axiom,
at(something,here,now),
file('theBenchmark.p',something_is_here_now) ).
cnf(cant_hold_and_let_go,axiom,
~ held(Thing,let_go(Situation)),
file('theBenchmark.p',cant_hold_and_let_go) ).
cnf(everything_is_red,axiom,
( red(Thing)
| ~ at(Thing,here,Situation) ),
file('theBenchmark.p',everything_is_red) ).
cnf(situation_let_go,axiom,
( at(Thing,Place,let_go(Situation))
| ~ at(Thing,Place,Situation) ),
file('theBenchmark.p',situation_let_go) ).
cnf(situation_pick_up,axiom,
( at(Thing,Place,pick_up(Situation))
| ~ at(Thing,Place,Situation) ),
file('theBenchmark.p',situation_pick_up) ).
cnf(can_grab_if_previously_let_go,axiom,
( grabbed(Thing,pick_up(go(Place,let_go(Situation))))
| ~ at(Thing,Place,Situation) ),
file('theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(answer_if_red_and_put_there,axiom,
( answer(Situation)
| ~ put(Thing,there,Situation)
| ~ red(Thing) ),
file('theBenchmark.p',answer_if_red_and_put_there) ).
cnf(can_put_somewhere_if_grab_and_go_there,axiom,
( put(Thing,Another_place,go(Another_place,Situation))
| ~ grabbed(Thing,Situation)
| ~ at(Thing,Place,Situation) ),
file('theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(thing_either_held_or_went_there,axiom,
( at(Thing,Place,go(Another_place,Situation))
| ~ at(Thing,Place,Situation)
| held(Thing,Situation) ),
file('theBenchmark.p',thing_either_held_or_went_there) ).
cnf(prove_there_is_an_answer_situation,negated_conjecture,
~ answer(Situation),
file('theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(t1,plain,
~ held(something,let_go(pick_up(now))),
inference(start,[status(thm),parent(0:0)],[cant_hold_and_let_go]) ).
cnf(t2,plain,
( ~ at(something,here,let_go(pick_up(now)))
| at(something,here,go(here,let_go(pick_up(now))))
| held(something,let_go(pick_up(now))) ),
inference(extension,[status(thm),parent(t1:1)],[thing_either_held_or_went_there]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( at(something,here,pick_up(go(here,let_go(pick_up(now)))))
| ~ at(something,here,go(here,let_go(pick_up(now)))) ),
inference(extension,[status(thm),parent(t2:2)],[situation_pick_up]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ grabbed(something,pick_up(go(here,let_go(pick_up(now)))))
| put(something,there,go(there,pick_up(go(here,let_go(pick_up(now))))))
| ~ at(something,here,pick_up(go(here,let_go(pick_up(now))))) ),
inference(extension,[status(thm),parent(t4:2)],[can_put_somewhere_if_grab_and_go_there]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( answer(go(there,pick_up(go(here,let_go(pick_up(now))))))
| ~ red(something)
| ~ put(something,there,go(there,pick_up(go(here,let_go(pick_up(now)))))) ),
inference(extension,[status(thm),parent(t6:2)],[answer_if_red_and_put_there]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ at(something,here,pick_up(go(here,let_go(pick_up(now)))))
| red(something) ),
inference(extension,[status(thm),parent(t8:2)],[everything_is_red]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
$false,
inference(reduction,[status(thm),parent(t10:2)],[t10:2,t4:2]) ).
cnf(t13,plain,
~ answer(go(there,pick_up(go(here,let_go(pick_up(now)))))),
inference(extension,[status(thm),parent(t8:3)],[prove_there_is_an_answer_situation]) ).
cnf(t14,plain,
$false,
inference(connection,[status(thm),parent(t13:1)],[t13:1,t8:3]) ).
cnf(t15,plain,
( ~ at(something,here,pick_up(now))
| grabbed(something,pick_up(go(here,let_go(pick_up(now))))) ),
inference(extension,[status(thm),parent(t6:3)],[can_grab_if_previously_let_go]) ).
cnf(t16,plain,
$false,
inference(connection,[status(thm),parent(t15:1)],[t15:1,t6:3]) ).
cnf(t17,plain,
( ~ at(something,here,now)
| at(something,here,pick_up(now)) ),
inference(extension,[status(thm),parent(t15:2)],[situation_pick_up]) ).
cnf(t18,plain,
$false,
inference(connection,[status(thm),parent(t17:1)],[t17:1,t15:2]) ).
cnf(t19,plain,
at(something,here,now),
inference(extension,[status(thm),parent(t17:2)],[something_is_here_now]) ).
cnf(t20,plain,
$false,
inference(connection,[status(thm),parent(t19:1)],[t19:1,t17:2]) ).
cnf(t21,plain,
( ~ at(something,here,pick_up(now))
| at(something,here,let_go(pick_up(now))) ),
inference(extension,[status(thm),parent(t2:3)],[situation_let_go]) ).
cnf(t22,plain,
$false,
inference(connection,[status(thm),parent(t21:1)],[t21:1,t2:3]) ).
cnf(t23,plain,
( ~ at(something,here,now)
| at(something,here,pick_up(now)) ),
inference(extension,[status(thm),parent(t21:2)],[situation_pick_up]) ).
cnf(t24,plain,
$false,
inference(connection,[status(thm),parent(t23:1)],[t23:1,t21:2]) ).
cnf(t25,plain,
at(something,here,now),
inference(extension,[status(thm),parent(t23:2)],[something_is_here_now]) ).
cnf(t26,plain,
$false,
inference(connection,[status(thm),parent(t25:1)],[t25:1,t23:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.57 % Computer : n018.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Sat Sep 19 16:23:56 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------