%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PUZ131+1 : TPTP v8.1.2. Released v4.1.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 13:12:43 EDT 2023

% Result   : Theorem 0.18s 0.57s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   25
% Syntax   : Number of formulae    :   39 (  15 unt;  17 typ;   0 def)
%            Number of atoms       :   42 (   2 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   36 (  16   ~;  14   |;   1   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  11   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-1 aty)
%            Number of variables   :   13 (   0 sgn;   8   !;   0   ?;   0   :)

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

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

tff(decl_24,type,
    course: $i > $o ).

tff(decl_25,type,
    michael: $i ).

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

tff(decl_27,type,
    csc410: $i ).

tff(decl_28,type,
    coordinatorof: $i > $i ).

tff(decl_29,type,
    enrolled: ( $i * $i ) > $o ).

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

tff(decl_31,type,
    taughtby: ( $i * $i ) > $o ).

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

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

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

tff(decl_35,type,
    esk4_1: $i > $i ).

tff(decl_36,type,
    esk5_1: $i > $i ).

tff(decl_37,type,
    esk6_1: $i > $i ).

tff(decl_38,type,
    esk7_1: $i > $i ).

fof(coordinator_teaches,axiom,
    ! [X2] :
      ( course(X2)
     => teaches(coordinatorof(X2),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',coordinator_teaches) ).

fof(student_enrolled_taught,axiom,
    ! [X2,X3] :
      ( ( student(X2)
        & course(X3) )
     => ( enrolled(X2,X3)
       => ! [X4] :
            ( professor(X4)
           => ( teaches(X4,X3)
             => taughtby(X2,X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',student_enrolled_taught) ).

fof(victor_coordinator_csc410_axiom,axiom,
    coordinatorof(csc410) = victor,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',victor_coordinator_csc410_axiom) ).

fof(csc410_type,axiom,
    course(csc410),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',csc410_type) ).

fof(teaching_conjecture,conjecture,
    taughtby(michael,victor),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',teaching_conjecture) ).

fof(victor_type,axiom,
    professor(victor),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',victor_type) ).

fof(michael_enrolled_csc410_axiom,axiom,
    enrolled(michael,csc410),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',michael_enrolled_csc410_axiom) ).

fof(michael_type,axiom,
    student(michael),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',michael_type) ).

fof(c_0_8,plain,
    ! [X17] :
      ( ~ course(X17)
      | teaches(coordinatorof(X17),X17) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[coordinator_teaches])]) ).

fof(c_0_9,plain,
    ! [X18,X19,X20] :
      ( ~ student(X18)
      | ~ course(X19)
      | ~ enrolled(X18,X19)
      | ~ professor(X20)
      | ~ teaches(X20,X19)
      | taughtby(X18,X20) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[student_enrolled_taught])])]) ).

cnf(c_0_10,plain,
    ( teaches(coordinatorof(X1),X1)
    | ~ course(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    coordinatorof(csc410) = victor,
    inference(split_conjunct,[status(thm)],[victor_coordinator_csc410_axiom]) ).

cnf(c_0_12,plain,
    course(csc410),
    inference(split_conjunct,[status(thm)],[csc410_type]) ).

fof(c_0_13,negated_conjecture,
    ~ taughtby(michael,victor),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[teaching_conjecture])]) ).

cnf(c_0_14,plain,
    ( taughtby(X1,X3)
    | ~ student(X1)
    | ~ course(X2)
    | ~ enrolled(X1,X2)
    | ~ professor(X3)
    | ~ teaches(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    teaches(victor,csc410),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_16,plain,
    professor(victor),
    inference(split_conjunct,[status(thm)],[victor_type]) ).

cnf(c_0_17,negated_conjecture,
    ~ taughtby(michael,victor),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    ( taughtby(X1,victor)
    | ~ enrolled(X1,csc410)
    | ~ student(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_16])]) ).

cnf(c_0_19,plain,
    enrolled(michael,csc410),
    inference(split_conjunct,[status(thm)],[michael_enrolled_csc410_axiom]) ).

cnf(c_0_20,plain,
    student(michael),
    inference(split_conjunct,[status(thm)],[michael_type]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : PUZ131+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33  % Computer : n013.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Sat Aug 26 22:36:17 EDT 2023
% 0.18/0.33  % CPUTime  : 
% 0.18/0.56  start to proof: theBenchmark
% 0.18/0.57  % Version  : CSE_E---1.5
% 0.18/0.57  % Problem  : theBenchmark.p
% 0.18/0.57  % Proof found
% 0.18/0.57  % SZS status Theorem for theBenchmark.p
% 0.18/0.57  % SZS output start Proof
% See solution above
% 0.18/0.58  % Total time : 0.007000 s
% 0.18/0.58  % SZS output end Proof
% 0.18/0.58  % Total time : 0.010000 s
%------------------------------------------------------------------------------