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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PLA031-1.003 : 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 : n013.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 2.67s 2.87s
% Output   : CNFRefutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   33
% Syntax   : Number of formulae    :   79 (  36 unt;  12 typ;   0 def)
%            Number of atoms       :  106 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   80 (  41   ~;  39   |;   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  :   14 (   4   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-8 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :  182 (   4 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    s: ( $i * $i * $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,
    p0_1: $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_24,axiom,
    path(s0,p0_1),
    map1 ).

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

cnf(c_0_26,plain,
    ( s(s1,s2,s2,s0,s2,X1,s1,s1)
    | ~ path(p0_1,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_25]) ).

cnf(c_0_27,axiom,
    path(p0_1,s1),
    map4 ).

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

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

cnf(c_0_30,axiom,
    ( s(truck1,X2,X3,X4,X5,X6,X1,X7)
    | ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
    load1 ).

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

cnf(c_0_32,plain,
    ( s(X1,X2,X3,X4,s2,truck1,X5,X6)
    | ~ s(X1,X2,X3,X4,s2,X5,X5,X6) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    s(truck1,s2,s2,s0,s2,s1,s1,s1),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

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

cnf(c_0_35,plain,
    s(truck1,s2,s2,s0,s2,truck1,s1,s1),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    ( s(truck1,s2,s2,s0,s2,truck1,X1,s1)
    | ~ link(s1,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,axiom,
    link(s1,s2),
    map13 ).

cnf(c_0_38,axiom,
    ( s(X1,X2,X3,X4,X5,X6,X1,X7)
    | ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
    load2 ).

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

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

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

cnf(c_0_42,plain,
    s(s2,s2,truck1,s0,s2,truck1,s2,s1),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

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

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

cnf(c_0_45,axiom,
    ( s(X1,X2,X3,X4,X5,X6,X3,X7)
    | ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
    load10 ).

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

cnf(c_0_47,axiom,
    ( s(X1,X2,X3,truck1,X5,X6,X4,X7)
    | ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
    load13 ).

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

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

cnf(c_0_50,plain,
    ( s(s2,s2,s0,truck1,s2,truck1,X1,s1)
    | ~ link(s0,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_49]) ).

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

cnf(c_0_52,axiom,
    ( s(X1,X2,X3,X4,X5,X6,X4,X7)
    | ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
    load14 ).

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

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

cnf(c_0_55,plain,
    ( s(s2,s2,s0,s2,s2,truck1,X1,s1)
    | ~ link(s2,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_54]) ).

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

cnf(c_0_57,plain,
    s(s2,s2,s0,s2,s2,truck1,s0,s1),
    inference(spm,[status(thm)],[c_0_55,c_0_44]) ).

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

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

cnf(c_0_60,plain,
    ( s(s2,s2,s0,s2,X1,s0,s0,s1)
    | ~ path(s2,X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_61,axiom,
    path(s2,p1_2),
    map7 ).

cnf(c_0_62,plain,
    s(s2,s2,s0,s2,p1_2,s0,s0,s1),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_63,plain,
    ( s(s2,s2,s0,s2,X1,s0,s0,s1)
    | ~ path(p1_2,X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_62]) ).

cnf(c_0_64,axiom,
    path(p1_2,s1),
    map6 ).

cnf(c_0_65,negated_conjecture,
    ~ s(s2,s2,s0,s2,s1,X1,s0,X2),
    goal ).

cnf(c_0_66,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : PLA031-1.003 : 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.17/0.35  % Computer : n013.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit   : 300
% 0.17/0.35  % WCLimit    : 300
% 0.17/0.35  % DateTime   : Sun Aug 27 05:47:17 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 2.67/2.87  % Version  : CSE_E---1.5
% 2.67/2.87  % Problem  : theBenchmark.p
% 2.67/2.87  % Proof found
% 2.67/2.87  % SZS status Theorem for theBenchmark.p
% 2.67/2.87  % SZS output start Proof
% See solution above
% 2.67/2.88  % Total time : 2.311000 s
% 2.67/2.88  % SZS output end Proof
% 2.67/2.88  % Total time : 2.315000 s
%------------------------------------------------------------------------------