TSTP Solution File: PLA002-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PLA002-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 : n026.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 0.20s 0.52s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   41 (   9 unt;  15 typ;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  26   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (   8   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   28 (  16 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

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

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

tff(decl_30,type,
    skate: ( $i * $i ) > $i ).

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

tff(decl_32,type,
    climb: ( $i * $i ) > $i ).

tff(decl_33,type,
    go: ( $i * $i ) > $i ).

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

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

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

cnf(walk_b_to_a,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a) ).

cnf(prove_you_can_get_to_a,negated_conjecture,
    ~ at(a,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a) ).

cnf(cross_river_c_to_b,hypothesis,
    ( at(b,skate(b,X1))
    | ~ cold(X1)
    | ~ at(c,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).

cnf(warm_or_cold,hypothesis,
    ( warm(X1)
    | cold(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).

cnf(go_d_to_c,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).

cnf(go_f_to_d,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).

cnf(climb_mountain_d_to_b,hypothesis,
    ( at(b,climb(b,X1))
    | ~ warm(X1)
    | ~ at(d,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).

cnf(initial,hypothesis,
    at(f,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).

cnf(c_0_8,hypothesis,
    ( at(a,walk(a,X1))
    | ~ at(b,X1) ),
    walk_b_to_a ).

cnf(c_0_9,negated_conjecture,
    ~ at(a,X1),
    prove_you_can_get_to_a ).

cnf(c_0_10,hypothesis,
    ( at(b,skate(b,X1))
    | ~ cold(X1)
    | ~ at(c,X1) ),
    cross_river_c_to_b ).

cnf(c_0_11,hypothesis,
    ~ at(b,X1),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,hypothesis,
    ( ~ at(c,X1)
    | ~ cold(X1) ),
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,hypothesis,
    ( warm(X1)
    | cold(X2) ),
    warm_or_cold ).

cnf(c_0_14,hypothesis,
    ( warm(X1)
    | ~ at(c,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,hypothesis,
    ( at(c,go(c,X1))
    | ~ at(d,X1) ),
    go_d_to_c ).

cnf(c_0_16,hypothesis,
    ( warm(X1)
    | ~ at(d,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,hypothesis,
    ( at(d,go(d,X1))
    | ~ at(f,X1) ),
    go_f_to_d ).

cnf(c_0_18,hypothesis,
    ( at(b,climb(b,X1))
    | ~ warm(X1)
    | ~ at(d,X1) ),
    climb_mountain_d_to_b ).

cnf(c_0_19,hypothesis,
    ( warm(X1)
    | ~ at(f,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,hypothesis,
    at(f,s0),
    initial ).

cnf(c_0_21,hypothesis,
    ( ~ at(d,X1)
    | ~ warm(X1) ),
    inference(sr,[status(thm)],[c_0_18,c_0_11]) ).

cnf(c_0_22,hypothesis,
    warm(X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,hypothesis,
    ~ at(d,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_24,hypothesis,
    ~ at(f,X1),
    inference(spm,[status(thm)],[c_0_23,c_0_17]) ).

cnf(c_0_25,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_20,c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PLA002-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.13/0.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sun Aug 27 05:54:48 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.51  start to proof: theBenchmark
% 0.20/0.52  % Version  : CSE_E---1.5
% 0.20/0.52  % Problem  : theBenchmark.p
% 0.20/0.52  % Proof found
% 0.20/0.52  % SZS status Theorem for theBenchmark.p
% 0.20/0.52  % SZS output start Proof
% See solution above
% 0.20/0.53  % Total time : 0.005000 s
% 0.20/0.53  % SZS output end Proof
% 0.20/0.53  % Total time : 0.007000 s
%------------------------------------------------------------------------------