TSTP Solution File: PLA031-1.001 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PLA031-1.001 : TPTP v8.1.2. Released v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n025.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:22 EDT 2023

% Result   : Unsatisfiable 1.17s 1.30s
% Output   : CNFRefutation 1.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :   34
% Syntax   : Number of formulae    :   84 (  40 unt;  12 typ;   0 def)
%            Number of atoms       :  116 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   90 (  46   ~;  44   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (   4   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-6 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :  130 (   0 sgn;   0   !;   0   ?;   0   :)

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

tff(decl_23,type,
    truck1: $i ).

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

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

tff(decl_26,type,
    link: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

cnf(walk1,axiom,
    ( s(X1,X2,X7,X4,X5,X6)
    | ~ s(X1,X2,X3,X4,X5,X6)
    | ~ path(X3,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).

cnf(init,axiom,
    s(s2,s2,s0,s1,s0,s2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).

cnf(map7,axiom,
    path(s0,p2_0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).

cnf(map6,axiom,
    path(p2_0,s2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).

cnf(walk2,axiom,
    ( s(X1,X2,X3,X7,X5,X6)
    | ~ s(X1,X2,X3,X4,X5,X6)
    | ~ path(X4,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk2) ).

cnf(map1,axiom,
    path(s1,p1_0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map1) ).

cnf(board5,axiom,
    ( s(X1,X2,X3,truck1,X4,X5)
    | ~ s(X1,X2,X3,X4,X4,X5)
    | ~ neq(X3,truck1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board5) ).

cnf(neq33,axiom,
    neq(s2,truck1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq33) ).

cnf(map4,axiom,
    path(p1_0,s0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map4) ).

cnf(drive3,axiom,
    ( s(X1,X2,X3,truck1,X6,X5)
    | ~ s(X1,X2,X3,truck1,X4,X5)
    | ~ link(X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive3) ).

cnf(map15,axiom,
    link(s0,s2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map15) ).

cnf(load5,axiom,
    ( s(X1,truck1,X3,X4,X2,X5)
    | ~ s(X1,X2,X3,X4,X2,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load5) ).

cnf(map18,axiom,
    link(s2,s1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map18) ).

cnf(load6,axiom,
    ( s(X1,X2,X3,X4,X2,X5)
    | ~ s(X1,truck1,X3,X4,X2,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load6) ).

cnf(map17,axiom,
    link(s1,s2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map17) ).

cnf(board7,axiom,
    ( s(X1,X2,X3,truck2,X5,X4)
    | ~ s(X1,X2,X3,X4,X5,X4)
    | ~ neq(X3,truck2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board7) ).

cnf(neq34,axiom,
    neq(s2,truck2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq34) ).

cnf(board6,axiom,
    ( s(X1,X2,X3,X4,X4,X5)
    | ~ s(X1,X2,X3,truck1,X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board6) ).

cnf(drive4,axiom,
    ( s(X1,X2,X3,truck2,X4,X6)
    | ~ s(X1,X2,X3,truck2,X4,X5)
    | ~ link(X5,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive4) ).

cnf(map16,axiom,
    link(s2,s0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map16) ).

cnf(board8,axiom,
    ( s(X1,X2,X3,X4,X5,X4)
    | ~ s(X1,X2,X3,truck2,X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board8) ).

cnf(goal,negated_conjecture,
    ~ s(s2,s1,s2,s2,s2,s0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c_0_22,axiom,
    ( s(X1,X2,X7,X4,X5,X6)
    | ~ s(X1,X2,X3,X4,X5,X6)
    | ~ path(X3,X7) ),
    walk1 ).

cnf(c_0_23,axiom,
    s(s2,s2,s0,s1,s0,s2),
    init ).

cnf(c_0_24,plain,
    ( s(s2,s2,X1,s1,s0,s2)
    | ~ path(s0,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,axiom,
    path(s0,p2_0),
    map7 ).

cnf(c_0_26,plain,
    s(s2,s2,p2_0,s1,s0,s2),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,plain,
    ( s(s2,s2,X1,s1,s0,s2)
    | ~ path(p2_0,X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_26]) ).

cnf(c_0_28,axiom,
    path(p2_0,s2),
    map6 ).

cnf(c_0_29,axiom,
    ( s(X1,X2,X3,X7,X5,X6)
    | ~ s(X1,X2,X3,X4,X5,X6)
    | ~ path(X4,X7) ),
    walk2 ).

cnf(c_0_30,plain,
    s(s2,s2,s2,s1,s0,s2),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( s(s2,s2,s2,X1,s0,s2)
    | ~ path(s1,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,axiom,
    path(s1,p1_0),
    map1 ).

cnf(c_0_33,plain,
    s(s2,s2,s2,p1_0,s0,s2),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,axiom,
    ( s(X1,X2,X3,truck1,X4,X5)
    | ~ s(X1,X2,X3,X4,X4,X5)
    | ~ neq(X3,truck1) ),
    board5 ).

cnf(c_0_35,axiom,
    neq(s2,truck1),
    neq33 ).

cnf(c_0_36,plain,
    ( s(s2,s2,s2,X1,s0,s2)
    | ~ path(p1_0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_33]) ).

cnf(c_0_37,axiom,
    path(p1_0,s0),
    map4 ).

cnf(c_0_38,plain,
    ( s(X1,X2,s2,truck1,X3,X4)
    | ~ s(X1,X2,s2,X3,X3,X4) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    s(s2,s2,s2,s0,s0,s2),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,axiom,
    ( s(X1,X2,X3,truck1,X6,X5)
    | ~ s(X1,X2,X3,truck1,X4,X5)
    | ~ link(X4,X6) ),
    drive3 ).

cnf(c_0_41,plain,
    s(s2,s2,s2,truck1,s0,s2),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_42,plain,
    ( s(s2,s2,s2,truck1,X1,s2)
    | ~ link(s0,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,axiom,
    link(s0,s2),
    map15 ).

cnf(c_0_44,axiom,
    ( s(X1,truck1,X3,X4,X2,X5)
    | ~ s(X1,X2,X3,X4,X2,X5) ),
    load5 ).

cnf(c_0_45,plain,
    s(s2,s2,s2,truck1,s2,s2),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    s(s2,truck1,s2,truck1,s2,s2),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_47,plain,
    ( s(s2,truck1,s2,truck1,X1,s2)
    | ~ link(s2,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_46]) ).

cnf(c_0_48,axiom,
    link(s2,s1),
    map18 ).

cnf(c_0_49,axiom,
    ( s(X1,X2,X3,X4,X2,X5)
    | ~ s(X1,truck1,X3,X4,X2,X5) ),
    load6 ).

cnf(c_0_50,plain,
    s(s2,truck1,s2,truck1,s1,s2),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    s(s2,s1,s2,truck1,s1,s2),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_52,plain,
    ( s(s2,s1,s2,truck1,X1,s2)
    | ~ link(s1,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_51]) ).

cnf(c_0_53,axiom,
    link(s1,s2),
    map17 ).

cnf(c_0_54,axiom,
    ( s(X1,X2,X3,truck2,X5,X4)
    | ~ s(X1,X2,X3,X4,X5,X4)
    | ~ neq(X3,truck2) ),
    board7 ).

cnf(c_0_55,axiom,
    neq(s2,truck2),
    neq34 ).

cnf(c_0_56,axiom,
    ( s(X1,X2,X3,X4,X4,X5)
    | ~ s(X1,X2,X3,truck1,X4,X5) ),
    board6 ).

cnf(c_0_57,plain,
    s(s2,s1,s2,truck1,s2,s2),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_58,plain,
    ( s(X1,X2,s2,truck2,X3,X4)
    | ~ s(X1,X2,s2,X4,X3,X4) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_59,plain,
    s(s2,s1,s2,s2,s2,s2),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,axiom,
    ( s(X1,X2,X3,truck2,X4,X6)
    | ~ s(X1,X2,X3,truck2,X4,X5)
    | ~ link(X5,X6) ),
    drive4 ).

cnf(c_0_61,plain,
    s(s2,s1,s2,truck2,s2,s2),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_62,plain,
    ( s(s2,s1,s2,truck2,s2,X1)
    | ~ link(s2,X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_63,axiom,
    link(s2,s0),
    map16 ).

cnf(c_0_64,axiom,
    ( s(X1,X2,X3,X4,X5,X4)
    | ~ s(X1,X2,X3,truck2,X5,X4) ),
    board8 ).

cnf(c_0_65,plain,
    s(s2,s1,s2,truck2,s2,s0),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_66,plain,
    s(s2,s1,s2,s0,s2,s0),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_67,plain,
    ( s(s2,s1,s2,X1,s2,s0)
    | ~ path(s0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_66]) ).

cnf(c_0_68,plain,
    s(s2,s1,s2,p2_0,s2,s0),
    inference(spm,[status(thm)],[c_0_67,c_0_25]) ).

cnf(c_0_69,plain,
    ( s(s2,s1,s2,X1,s2,s0)
    | ~ path(p2_0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_68]) ).

cnf(c_0_70,negated_conjecture,
    ~ s(s2,s1,s2,s2,s2,s0),
    goal ).

cnf(c_0_71,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_28]),c_0_70]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : PLA031-1.001 : TPTP v8.1.2. Released v3.5.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n025.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 06:21:53 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 1.17/1.30  % Version  : CSE_E---1.5
% 1.17/1.30  % Problem  : theBenchmark.p
% 1.17/1.30  % Proof found
% 1.17/1.30  % SZS status Theorem for theBenchmark.p
% 1.17/1.30  % SZS output start Proof
% See solution above
% 1.17/1.31  % Total time : 0.724000 s
% 1.17/1.31  % SZS output end Proof
% 1.17/1.31  % Total time : 0.728000 s
%------------------------------------------------------------------------------