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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.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:08:47 EDT 2022

% Result   : Theorem 6.70s 2.23s
% Output   : CNFRefutation 6.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  14 unt;   0 nHn;  20 RR)
%            Number of literals    :   38 (   2 equ;  20 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
    ( taughtby(X1,X2)
    | ~ student(X1)
    | ~ professor(X2)
    | ~ course(X3)
    | ~ enrolled(X1,X3)
    | ~ teaches(X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_17) ).

cnf(i_0_6,plain,
    course(csc410),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_6) ).

cnf(i_0_16,plain,
    ( teaches(coordinatorof(X1),X1)
    | ~ course(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_16) ).

cnf(i_0_19,plain,
    coordinatorof(csc410) = victor,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_19) ).

cnf(i_0_5,plain,
    professor(victor),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_5) ).

cnf(i_0_4,plain,
    student(michael),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_4) ).

cnf(i_0_18,plain,
    enrolled(michael,csc410),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_18) ).

cnf(i_0_20,negated_conjecture,
    ~ taughtby(michael,victor),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mjor6oi_/input.p',i_0_20) ).

cnf(c_0_29,plain,
    ( taughtby(X1,X2)
    | ~ student(X1)
    | ~ professor(X2)
    | ~ course(X3)
    | ~ enrolled(X1,X3)
    | ~ teaches(X2,X3) ),
    i_0_17 ).

cnf(c_0_30,plain,
    course(csc410),
    i_0_6 ).

cnf(c_0_31,plain,
    ( teaches(coordinatorof(X1),X1)
    | ~ course(X1) ),
    i_0_16 ).

cnf(c_0_32,plain,
    coordinatorof(csc410) = victor,
    i_0_19 ).

cnf(c_0_33,plain,
    ( taughtby(X1,X2)
    | ~ teaches(X2,csc410)
    | ~ enrolled(X1,csc410)
    | ~ professor(X2)
    | ~ student(X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,plain,
    professor(victor),
    i_0_5 ).

cnf(c_0_35,plain,
    teaches(victor,csc410),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_32]) ).

cnf(c_0_36,plain,
    ( taughtby(X1,victor)
    | ~ enrolled(X1,csc410)
    | ~ student(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).

cnf(c_0_37,plain,
    student(michael),
    i_0_4 ).

cnf(c_0_38,plain,
    enrolled(michael,csc410),
    i_0_18 ).

cnf(c_0_39,negated_conjecture,
    ~ taughtby(michael,victor),
    i_0_20 ).

cnf(c_0_40,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n023.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  : 600
% 0.13/0.33  % DateTime : Sun May 29 02:09:14 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.42  # ENIGMATIC: Selected complete mode:
% 6.70/2.23  # ENIGMATIC: Solved by autoschedule:
% 6.70/2.23  # No SInE strategy applied
% 6.70/2.23  # Trying AutoSched0 for 150 seconds
% 6.70/2.23  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S051A
% 6.70/2.23  # and selection function SelectMinInfpos.
% 6.70/2.23  #
% 6.70/2.23  # Preprocessing time       : 0.023 s
% 6.70/2.23  # Presaturation interreduction done
% 6.70/2.23  
% 6.70/2.23  # Proof found!
% 6.70/2.23  # SZS status Theorem
% 6.70/2.23  # SZS output start CNFRefutation
% See solution above
% 6.70/2.23  # Training examples: 0 positive, 0 negative
% 6.70/2.23  
% 6.70/2.23  # -------------------------------------------------
% 6.70/2.23  # User time                : 0.031 s
% 6.70/2.23  # System time              : 0.002 s
% 6.70/2.23  # Total time               : 0.033 s
% 6.70/2.23  # Maximum resident set size: 7124 pages
% 6.70/2.23  
%------------------------------------------------------------------------------