%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : MSC001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% 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 : Thu Aug 31 09:20:49 EDT 2023

% Result   : Unsatisfiable 0.19s 0.59s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   48 (  11 unt;  15 typ;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   70 (  38   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (   8   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   73 (  20 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    there: $i ).

tff(decl_23,type,
    at: ( $i * $i * $i ) > $o ).

tff(decl_24,type,
    here: $i ).

tff(decl_25,type,
    thing: $i > $i ).

tff(decl_26,type,
    let_go: $i ).

tff(decl_27,type,
    do: ( $i * $i ) > $i ).

tff(decl_28,type,
    hold: ( $i * $i ) > $o ).

tff(decl_29,type,
    hand: $i ).

tff(decl_30,type,
    red: $i > $o ).

tff(decl_31,type,
    go: $i > $i ).

tff(decl_32,type,
    s: $i ).

tff(decl_33,type,
    now: $i ).

tff(decl_34,type,
    taken: $i > $i ).

tff(decl_35,type,
    pick_up: $i ).

tff(decl_36,type,
    answer: $i > $o ).

cnf(clause_11,axiom,
    ( answer(X2)
    | ~ red(X1)
    | ~ at(X1,there,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).

cnf(prove_there_is_a_red_thing,negated_conjecture,
    ~ answer(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_red_thing) ).

cnf(clause_9,axiom,
    ( at(thing(X1),X3,X2)
    | ~ hold(thing(X1),X2)
    | ~ at(hand,X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_13,axiom,
    ( hold(thing(X1),do(go(X3),X2))
    | ~ hold(thing(X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).

cnf(clause_8,axiom,
    ( hold(thing(taken(X2)),do(pick_up,X2))
    | ~ at(hand,X1,X2)
    | ~ at(thing(X3),X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_14,axiom,
    ( at(thing(taken(X2)),X1,X2)
    | ~ at(hand,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).

cnf(clause_5,axiom,
    at(hand,X1,do(go(X1),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_7,axiom,
    ( at(thing(X1),X2,X3)
    | hold(thing(X1),X3)
    | ~ at(thing(X1),X2,do(go(X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

cnf(things_here_now_are_red,hypothesis,
    ( red(X1)
    | ~ at(X1,here,now) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',things_here_now_are_red) ).

cnf(clause_17,axiom,
    ( at(X1,X2,X3)
    | ~ at(X1,X2,do(let_go,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).

cnf(clause_2,axiom,
    ~ hold(thing(X1),do(let_go,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

cnf(c_0_11,axiom,
    ( answer(X2)
    | ~ red(X1)
    | ~ at(X1,there,X2) ),
    clause_11 ).

cnf(c_0_12,negated_conjecture,
    ~ answer(X1),
    prove_there_is_a_red_thing ).

cnf(c_0_13,axiom,
    ( at(thing(X1),X3,X2)
    | ~ hold(thing(X1),X2)
    | ~ at(hand,X3,X2) ),
    clause_9 ).

cnf(c_0_14,axiom,
    ( hold(thing(X1),do(go(X3),X2))
    | ~ hold(thing(X1),X2) ),
    clause_13 ).

cnf(c_0_15,plain,
    ( ~ red(X1)
    | ~ at(X1,there,X2) ),
    inference(sr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( at(thing(X1),X2,do(go(X3),X4))
    | ~ hold(thing(X1),X4)
    | ~ at(hand,X2,do(go(X3),X4)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( hold(thing(taken(X2)),do(pick_up,X2))
    | ~ at(hand,X1,X2)
    | ~ at(thing(X3),X1,X2) ),
    clause_8 ).

cnf(c_0_18,axiom,
    ( at(thing(taken(X2)),X1,X2)
    | ~ at(hand,X1,X2) ),
    clause_14 ).

cnf(c_0_19,plain,
    ( ~ red(thing(X1))
    | ~ hold(thing(X1),X2)
    | ~ at(hand,there,do(go(X3),X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,axiom,
    at(hand,X1,do(go(X1),X2)),
    clause_5 ).

cnf(c_0_21,plain,
    ( hold(thing(taken(X1)),do(pick_up,X1))
    | ~ at(hand,X2,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( ~ red(thing(X1))
    | ~ hold(thing(X1),X2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    hold(thing(taken(do(go(X1),X2))),do(pick_up,do(go(X1),X2))),
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

cnf(c_0_24,axiom,
    ( at(thing(X1),X2,X3)
    | hold(thing(X1),X3)
    | ~ at(thing(X1),X2,do(go(X2),X3)) ),
    clause_7 ).

cnf(c_0_25,plain,
    ~ red(thing(taken(do(go(X1),X2)))),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,hypothesis,
    ( red(X1)
    | ~ at(X1,here,now) ),
    things_here_now_are_red ).

cnf(c_0_27,axiom,
    ( at(X1,X2,X3)
    | ~ at(X1,X2,do(let_go,X3)) ),
    clause_17 ).

cnf(c_0_28,plain,
    ( hold(thing(taken(do(go(X1),X2))),X2)
    | at(thing(taken(do(go(X1),X2))),X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_20])]) ).

cnf(c_0_29,axiom,
    ~ hold(thing(X1),do(let_go,X2)),
    clause_2 ).

cnf(c_0_30,hypothesis,
    ~ at(thing(taken(do(go(X1),X2))),here,now),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,plain,
    at(thing(taken(do(go(X1),do(let_go,X2)))),X1,X2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_32,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_30,c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MSC001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Thu Aug 24 14:15:17 EDT 2023
% 0.19/0.35  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.59  % Version  : CSE_E---1.5
% 0.19/0.59  % Problem  : theBenchmark.p
% 0.19/0.59  % Proof found
% 0.19/0.59  % SZS status Theorem for theBenchmark.p
% 0.19/0.59  % SZS output start Proof
% See solution above
% 0.19/0.59  % Total time : 0.010000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.012000 s
%------------------------------------------------------------------------------