%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MSC002-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.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 : Tue May 5 04:48:44 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.73s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 9 unt; 2 nHn; 19 RR)
% Number of literals : 58 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 2 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 : 71 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(can_put_somewhere_if_grab_and_go_there,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',can_put_somewhere_if_grab_and_go_there) ).
cnf(situation_pick_up,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',situation_pick_up) ).
cnf(can_grab_if_previously_let_go,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',can_grab_if_previously_let_go) ).
cnf(thing_either_held_or_went_there,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thing_either_held_or_went_there) ).
cnf(situation_let_go,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',situation_let_go) ).
cnf(cant_hold_and_let_go,axiom,
~ held(X1,let_go(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cant_hold_and_let_go) ).
cnf(something_is_here_now,axiom,
at(something,here,now),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',something_is_here_now) ).
cnf(answer_if_red_and_put_there,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',answer_if_red_and_put_there) ).
cnf(prove_there_is_an_answer_situation,negated_conjecture,
~ answer(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer_situation) ).
cnf(everything_is_red,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everything_is_red) ).
cnf(c_0_10,axiom,
( put(X1,X4,go(X4,X3))
| ~ at(X1,X2,X3)
| ~ grabbed(X1,X3) ),
can_put_somewhere_if_grab_and_go_there ).
cnf(c_0_11,axiom,
( at(X1,X2,pick_up(X3))
| ~ at(X1,X2,X3) ),
situation_pick_up ).
cnf(c_0_12,plain,
( put(X1,X2,go(X2,pick_up(X3)))
| ~ grabbed(X1,pick_up(X3))
| ~ at(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( grabbed(X1,pick_up(go(X2,let_go(X3))))
| ~ at(X1,X2,X3) ),
can_grab_if_previously_let_go ).
cnf(c_0_14,axiom,
( held(X1,X2)
| at(X1,X3,go(X4,X2))
| ~ at(X1,X3,X2) ),
thing_either_held_or_went_there ).
cnf(c_0_15,axiom,
( at(X1,X2,let_go(X3))
| ~ at(X1,X2,X3) ),
situation_let_go ).
cnf(c_0_16,axiom,
~ held(X1,let_go(X2)),
cant_hold_and_let_go ).
cnf(c_0_17,plain,
( put(X1,X2,go(X2,pick_up(go(X3,let_go(X4)))))
| ~ at(X1,X5,go(X3,let_go(X4)))
| ~ at(X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( at(X1,X2,go(X3,let_go(X4)))
| ~ at(X1,X2,X4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
( put(X1,X2,go(X2,pick_up(go(X3,let_go(X4)))))
| ~ at(X1,X3,X4)
| ~ at(X1,X5,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
at(something,here,now),
something_is_here_now ).
cnf(c_0_21,axiom,
( answer(X2)
| ~ red(X1)
| ~ put(X1,there,X2) ),
answer_if_red_and_put_there ).
cnf(c_0_22,negated_conjecture,
~ answer(X1),
prove_there_is_an_answer_situation ).
cnf(c_0_23,plain,
( put(something,X1,go(X1,pick_up(go(here,let_go(now)))))
| ~ at(something,X2,now) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( red(X1)
| ~ at(X1,here,X2) ),
everything_is_red ).
cnf(c_0_25,plain,
( ~ put(X1,there,X2)
| ~ red(X1) ),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
put(something,X1,go(X1,pick_up(go(here,let_go(now))))),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_27,plain,
red(something),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC002-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n027.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:34:35 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.28/1.73 % Version : CSE_E---1.7
% 1.28/1.73 % Problem : theBenchmark.p
% 1.28/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73 % SZS output start CNFRefutation
% See solution above
% 1.28/1.73 % Total time : 1.368s
%------------------------------------------------------------------------------