TSTP Solution File: PUZ131-10 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n027.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   : Unsatisfiable 0.18s 0.49s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;  16 RR)
%            Number of literals    :   16 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-4 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(ifeq(u,u,v,w),v),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(5,axiom,
    equal(student(michael),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(6,axiom,
    equal(professor(victor),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(7,axiom,
    equal(course(csc410),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(17,axiom,
    equal(ifeq(course(u),true__dfg,teaches(coordinatorof(u),u),true__dfg),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(18,axiom,
    equal(ifeq(teaches(u,v),true__dfg,ifeq(enrolled(w,v),true__dfg,ifeq(course(v),true__dfg,ifeq(professor(u),true__dfg,ifeq(student(w),true__dfg,taughtby(w,u),true__dfg),true__dfg),true__dfg),true__dfg),true__dfg),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(19,axiom,
    equal(enrolled(michael,csc410),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(20,axiom,
    equal(coordinatorof(csc410),victor),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(21,axiom,
    ~ equal(taughtby(michael,victor),true__dfg),
    file('PUZ131-10.p',unknown),
    [] ).

cnf(153,plain,
    equal(ifeq(course(csc410),true__dfg,teaches(victor,csc410),true__dfg),true__dfg),
    inference(spr,[status(thm),theory(equality)],[20,17]),
    [iquote('0:SpR:20.0,17.0')] ).

cnf(162,plain,
    equal(teaches(victor,csc410),true__dfg),
    inference(rew,[status(thm),theory(equality)],[1,153,7]),
    [iquote('0:Rew:1.0,153.0,7.0,153.0')] ).

cnf(394,plain,
    equal(ifeq(teaches(u,csc410),true__dfg,ifeq(true__dfg,true__dfg,ifeq(course(csc410),true__dfg,ifeq(professor(u),true__dfg,ifeq(student(michael),true__dfg,taughtby(michael,u),true__dfg),true__dfg),true__dfg),true__dfg),true__dfg),true__dfg),
    inference(spr,[status(thm),theory(equality)],[19,18]),
    [iquote('0:SpR:19.0,18.0')] ).

cnf(404,plain,
    equal(ifeq(teaches(u,csc410),true__dfg,ifeq(professor(u),true__dfg,taughtby(michael,u),true__dfg),true__dfg),true__dfg),
    inference(rew,[status(thm),theory(equality)],[1,394,7,5]),
    [iquote('0:Rew:1.0,394.0,1.0,394.0,7.0,394.0,1.0,394.0,5.0,394.0')] ).

cnf(487,plain,
    equal(ifeq(true__dfg,true__dfg,ifeq(professor(victor),true__dfg,taughtby(michael,victor),true__dfg),true__dfg),true__dfg),
    inference(spr,[status(thm),theory(equality)],[162,404]),
    [iquote('0:SpR:162.0,404.0')] ).

cnf(489,plain,
    equal(taughtby(michael,victor),true__dfg),
    inference(rew,[status(thm),theory(equality)],[1,487,6]),
    [iquote('0:Rew:1.0,487.0,1.0,487.0,6.0,487.0')] ).

cnf(490,plain,
    $false,
    inference(mrr,[status(thm)],[489,21]),
    [iquote('0:MRR:489.0,21.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : PUZ131-10 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun May 29 01:53:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.49  
% 0.18/0.49  SPASS V 3.9 
% 0.18/0.49  SPASS beiseite: Proof found.
% 0.18/0.49  % SZS status Theorem
% 0.18/0.49  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.49  SPASS derived 271 clauses, backtracked 0 clauses, performed 0 splits and kept 192 clauses.
% 0.18/0.49  SPASS allocated 63814 KBytes.
% 0.18/0.49  SPASS spent	0:00:00.13 on the problem.
% 0.18/0.49  		0:00:00.04 for the input.
% 0.18/0.49  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.49  		0:00:00.00 for inferences.
% 0.18/0.49  		0:00:00.00 for the backtracking.
% 0.18/0.49  		0:00:00.07 for the reduction.
% 0.18/0.49  
% 0.18/0.49  
% 0.18/0.49  Here is a proof with depth 2, length 16 :
% 0.18/0.49  % SZS output start Refutation
% See solution above
% 0.18/0.49  Formulae used in the proof : ifeq_axiom michael_type victor_type csc410_type coordinator_teaches student_enrolled_taught michael_enrolled_csc410_axiom victor_coordinator_csc410_axiom teaching_conjecture
% 0.18/0.49  
%------------------------------------------------------------------------------