%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n028.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:27:33 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  15 RR)
%            Number of literals    :   29 (   0 equ;  19 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    student(michael),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(5,axiom,
    professor(victor),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(6,axiom,
    course(csc410),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(11,axiom,
    enrolled(michael,csc410),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(12,axiom,
    ~ taughtby(michael,victor),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(13,axiom,
    equal(coordinatorof(csc410),victor),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ course(u)
    | teaches(coordinatorof(u),u) ),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ course(u)
    | ~ professor(v)
    | ~ student(w)
    | ~ enrolled(w,u)
    | ~ teaches(v,u)
    | taughtby(w,v) ),
    file('PUZ131+1.p',unknown),
    [] ).

cnf(21,plain,
    ( ~ student(michael)
    | ~ professor(victor)
    | ~ course(u)
    | ~ teaches(victor,u)
    | ~ enrolled(michael,u) ),
    inference(res,[status(thm),theory(equality)],[20,12]),
    [iquote('0:Res:20.5,12.0')] ).

cnf(22,plain,
    ( ~ course(u)
    | ~ enrolled(michael,u)
    | ~ teaches(victor,u) ),
    inference(mrr,[status(thm)],[21,4,5]),
    [iquote('0:MRR:21.0,21.1,4.0,5.0')] ).

cnf(36,plain,
    ( ~ course(csc410)
    | teaches(victor,csc410) ),
    inference(spr,[status(thm),theory(equality)],[13,19]),
    [iquote('0:SpR:13.0,19.1')] ).

cnf(37,plain,
    teaches(victor,csc410),
    inference(ssi,[status(thm)],[36,6]),
    [iquote('0:SSi:36.0,6.0')] ).

cnf(38,plain,
    ( ~ course(csc410)
    | ~ teaches(victor,csc410) ),
    inference(res,[status(thm),theory(equality)],[11,22]),
    [iquote('0:Res:11.0,22.1')] ).

cnf(40,plain,
    ~ teaches(victor,csc410),
    inference(ssi,[status(thm)],[38,6]),
    [iquote('0:SSi:38.0,6.0')] ).

cnf(41,plain,
    $false,
    inference(mrr,[status(thm)],[40,37]),
    [iquote('0:MRR:40.0,37.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : PUZ131+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun May 29 01:55:03 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 24 clauses.
% 0.18/0.43  SPASS allocated 103961 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.04 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 2, length 15 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : michael_type victor_type csc410_type michael_enrolled_csc410_axiom teaching_conjecture victor_coordinator_csc410_axiom coordinator_teaches student_enrolled_taught
% 0.18/0.43  
%------------------------------------------------------------------------------