TSTP Solution File: PUZ047+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n023.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  : 600s
% DateTime : Mon Jul 18 18:07:55 EDT 2022

% Result   : Theorem 8.65s 2.52s
% Output   : CNFRefutation 8.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (  12 unt;   0 nHn;  32 RR)
%            Number of literals    :   64 (   0 equ;  34 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    7 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-5 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-1 aty)
%            Number of variables   :   32 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( p(north,X1,north,X2,take_goat(X3))
    | ~ epred1_0
    | ~ p(south,X1,south,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_8) ).

cnf(i_0_2,negated_conjecture,
    epred1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_2) ).

cnf(i_0_17,plain,
    ( p(south,south,south,south,start)
    | ~ epred1_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_17) ).

cnf(i_0_13,plain,
    ( p(south,south,north,south,go_alone(X1))
    | ~ epred1_0
    | ~ p(north,south,north,south,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_13) ).

cnf(i_0_10,plain,
    ( p(north,north,north,south,take_wolf(X1))
    | ~ epred1_0
    | ~ p(south,south,north,south,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_10) ).

cnf(i_0_7,plain,
    ( p(south,X1,south,X2,take_goat(X3))
    | ~ epred1_0
    | ~ p(north,X1,north,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_7) ).

cnf(i_0_6,plain,
    ( p(north,north,south,north,take_cabbage(X1))
    | ~ epred1_0
    | ~ p(south,north,south,south,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_6) ).

cnf(i_0_15,plain,
    ( p(south,north,south,north,go_alone(X1))
    | ~ epred1_0
    | ~ p(north,north,south,north,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_15) ).

cnf(i_0_1,negated_conjecture,
    ~ p(north,north,north,north,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dk3kala7/input.p',i_0_1) ).

cnf(c_0_27,plain,
    ( p(north,X1,north,X2,take_goat(X3))
    | ~ epred1_0
    | ~ p(south,X1,south,X2,X3) ),
    i_0_8 ).

cnf(c_0_28,negated_conjecture,
    epred1_0,
    i_0_2 ).

cnf(c_0_29,plain,
    ( p(south,south,south,south,start)
    | ~ epred1_0 ),
    i_0_17 ).

cnf(c_0_30,plain,
    ( p(south,south,north,south,go_alone(X1))
    | ~ epred1_0
    | ~ p(north,south,north,south,X1) ),
    i_0_13 ).

cnf(c_0_31,plain,
    ( p(north,X1,north,X2,take_goat(X3))
    | ~ p(south,X1,south,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).

cnf(c_0_32,plain,
    p(south,south,south,south,start),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28])]) ).

cnf(c_0_33,plain,
    ( p(north,north,north,south,take_wolf(X1))
    | ~ epred1_0
    | ~ p(south,south,north,south,X1) ),
    i_0_10 ).

cnf(c_0_34,plain,
    ( p(south,south,north,south,go_alone(X1))
    | ~ p(north,south,north,south,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_28])]) ).

cnf(c_0_35,plain,
    p(north,south,north,south,take_goat(start)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    ( p(south,X1,south,X2,take_goat(X3))
    | ~ epred1_0
    | ~ p(north,X1,north,X2,X3) ),
    i_0_7 ).

cnf(c_0_37,plain,
    ( p(north,north,north,south,take_wolf(X1))
    | ~ p(south,south,north,south,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_28])]) ).

cnf(c_0_38,plain,
    p(south,south,north,south,go_alone(take_goat(start))),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    ( p(north,north,south,north,take_cabbage(X1))
    | ~ epred1_0
    | ~ p(south,north,south,south,X1) ),
    i_0_6 ).

cnf(c_0_40,plain,
    ( p(south,X1,south,X2,take_goat(X3))
    | ~ p(north,X1,north,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_28])]) ).

cnf(c_0_41,plain,
    p(north,north,north,south,take_wolf(go_alone(take_goat(start)))),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ( p(south,north,south,north,go_alone(X1))
    | ~ epred1_0
    | ~ p(north,north,south,north,X1) ),
    i_0_15 ).

cnf(c_0_43,plain,
    ( p(north,north,south,north,take_cabbage(X1))
    | ~ p(south,north,south,south,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_28])]) ).

cnf(c_0_44,plain,
    p(south,north,south,south,take_goat(take_wolf(go_alone(take_goat(start))))),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( p(south,north,south,north,go_alone(X1))
    | ~ p(north,north,south,north,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_28])]) ).

cnf(c_0_46,plain,
    p(north,north,south,north,take_cabbage(take_goat(take_wolf(go_alone(take_goat(start)))))),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,plain,
    p(south,north,south,north,go_alone(take_cabbage(take_goat(take_wolf(go_alone(take_goat(start))))))),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ~ p(north,north,north,north,X1),
    i_0_1 ).

cnf(c_0_49,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_48]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : PUZ047+1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun May 29 01:34:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.65/2.52  # ENIGMATIC: Solved by autoschedule:
% 8.65/2.52  # No SInE strategy applied
% 8.65/2.52  # Trying AutoSched0 for 150 seconds
% 8.65/2.52  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S077I
% 8.65/2.52  # and selection function SelectCQArNpEqFirst.
% 8.65/2.52  #
% 8.65/2.52  # Preprocessing time       : 0.018 s
% 8.65/2.52  # Presaturation interreduction done
% 8.65/2.52  
% 8.65/2.52  # Proof found!
% 8.65/2.52  # SZS status Theorem
% 8.65/2.52  # SZS output start CNFRefutation
% See solution above
% 8.65/2.52  # Training examples: 0 positive, 0 negative
% 8.65/2.52  
% 8.65/2.52  # -------------------------------------------------
% 8.65/2.52  # User time                : 0.021 s
% 8.65/2.52  # System time              : 0.004 s
% 8.65/2.52  # Total time               : 0.025 s
% 8.65/2.52  # Maximum resident set size: 7124 pages
% 8.65/2.52  
%------------------------------------------------------------------------------