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

% Computer : n018.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 12:59:12 EDT 2023

% Result   : Unsatisfiable 27.68s 27.79s
% Output   : CNFRefutation 27.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   49 (  16 unt;  20 typ;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   69 (  38   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   6   >;   5   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :   18 (  18 usr;  14 con; 0-2 aty)
%            Number of variables   :   49 (   6 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    at: ( $i * $i * $i * $i ) > $o ).

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

tff(decl_24,type,
    s: $i > $i ).

tff(decl_25,type,
    drive: ( $i * $i ) > $i ).

tff(decl_26,type,
    wait_at: $i > $i ).

tff(decl_27,type,
    buy: $i > $i ).

tff(decl_28,type,
    winnemucca: $i ).

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

tff(decl_30,type,
    saltLakeCity: $i ).

tff(decl_31,type,
    rockSprings: $i ).

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

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

tff(decl_34,type,
    northPlatte: $i ).

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

tff(decl_36,type,
    lincoln: $i ).

tff(decl_37,type,
    omaha: $i ).

tff(decl_38,type,
    desMoines: $i ).

tff(decl_39,type,
    none: $i ).

tff(decl_40,type,
    start: $i ).

tff(decl_41,type,
    initial_situation: $i ).

cnf(drive1,axiom,
    ( at(X5,X2,s(s(X3)),drive(X5,X4))
    | ~ at(X1,X2,X3,X4)
    | ~ next_to(X1,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive1) ).

cnf(initial,hypothesis,
    at(cheyenne,none,start,initial_situation),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial) ).

cnf(prove_you_gat_get_there_with_bread,negated_conjecture,
    ~ at(desMoines,s(none),X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_you_gat_get_there_with_bread) ).

cnf(buy_in_city,axiom,
    ( at(X1,s(X2),s(X3),buy(X4))
    | ~ at(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',buy_in_city) ).

cnf(map6,hypothesis,
    next_to(cheyenne,northPlatte),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).

cnf(map10,hypothesis,
    next_to(omaha,desMoines),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map10) ).

cnf(map7,hypothesis,
    next_to(northPlatte,grandIsland),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).

cnf(map9,hypothesis,
    next_to(lincoln,omaha),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map9) ).

cnf(map8,hypothesis,
    next_to(grandIsland,lincoln),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map8) ).

cnf(c_0_9,axiom,
    ( at(X5,X2,s(s(X3)),drive(X5,X4))
    | ~ at(X1,X2,X3,X4)
    | ~ next_to(X1,X5) ),
    drive1 ).

cnf(c_0_10,hypothesis,
    at(cheyenne,none,start,initial_situation),
    initial ).

cnf(c_0_11,hypothesis,
    ( at(X1,none,s(s(start)),drive(X1,initial_situation))
    | ~ next_to(cheyenne,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,hypothesis,
    ( at(X1,none,s(s(s(s(start)))),drive(X1,drive(X2,initial_situation)))
    | ~ next_to(cheyenne,X2)
    | ~ next_to(X2,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_11]) ).

cnf(c_0_13,hypothesis,
    ( at(X1,none,s(s(s(s(s(s(start)))))),drive(X1,drive(X2,drive(X3,initial_situation))))
    | ~ next_to(cheyenne,X3)
    | ~ next_to(X2,X1)
    | ~ next_to(X3,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_14,negated_conjecture,
    ~ at(desMoines,s(none),X1,X2),
    prove_you_gat_get_there_with_bread ).

cnf(c_0_15,axiom,
    ( at(X1,s(X2),s(X3),buy(X4))
    | ~ at(X1,X2,X3,X4) ),
    buy_in_city ).

cnf(c_0_16,hypothesis,
    ( at(X1,none,s(s(s(s(s(s(s(s(start)))))))),drive(X1,drive(X2,drive(X3,drive(X4,initial_situation)))))
    | ~ next_to(cheyenne,X4)
    | ~ next_to(X2,X1)
    | ~ next_to(X3,X2)
    | ~ next_to(X4,X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ at(desMoines,none,X1,X2),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,hypothesis,
    ( at(X1,none,s(s(s(s(s(s(s(s(s(s(start)))))))))),drive(X1,drive(X2,drive(X3,drive(X4,drive(X5,initial_situation))))))
    | ~ next_to(cheyenne,X5)
    | ~ next_to(X2,X1)
    | ~ next_to(X3,X2)
    | ~ next_to(X4,X3)
    | ~ next_to(X5,X4) ),
    inference(spm,[status(thm)],[c_0_9,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ next_to(cheyenne,X1)
    | ~ next_to(X2,desMoines)
    | ~ next_to(X3,X2)
    | ~ next_to(X4,X3)
    | ~ next_to(X1,X4) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,hypothesis,
    next_to(cheyenne,northPlatte),
    map6 ).

cnf(c_0_21,hypothesis,
    ( ~ next_to(X1,desMoines)
    | ~ next_to(northPlatte,X2)
    | ~ next_to(X3,X1)
    | ~ next_to(X2,X3) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_22,hypothesis,
    next_to(omaha,desMoines),
    map10 ).

cnf(c_0_23,hypothesis,
    ( ~ next_to(northPlatte,X1)
    | ~ next_to(X2,omaha)
    | ~ next_to(X1,X2) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,hypothesis,
    next_to(northPlatte,grandIsland),
    map7 ).

cnf(c_0_25,hypothesis,
    ( ~ next_to(X1,omaha)
    | ~ next_to(grandIsland,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,hypothesis,
    next_to(lincoln,omaha),
    map9 ).

cnf(c_0_27,hypothesis,
    next_to(grandIsland,lincoln),
    map8 ).

cnf(c_0_28,hypothesis,
    $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.13/0.13  % Problem    : PLA001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun Aug 27 05:54:30 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.59  start to proof: theBenchmark
% 27.68/27.79  % Version  : CSE_E---1.5
% 27.68/27.79  % Problem  : theBenchmark.p
% 27.68/27.79  % Proof found
% 27.68/27.79  % SZS status Theorem for theBenchmark.p
% 27.68/27.79  % SZS output start Proof
% See solution above
% 27.68/27.79  % Total time : 27.191000 s
% 27.68/27.79  % SZS output end Proof
% 27.68/27.79  % Total time : 27.195000 s
%------------------------------------------------------------------------------