TSTP Solution File: PUZ131-10 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PUZ131-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n006.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 : Tue Aug 22 10:54:15 EDT 2023

% Result   : Unsatisfiable 4.03s 2.11s
% Output   : CNFRefutation 4.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   44 (  25 unt;  19 typ;   0 def)
%            Number of atoms       :   25 (  24 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   18 (  12   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   7 con; 0-4 aty)
%            Number of variables   :   16 (;  16   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ ifeq > teaches > taughtby > enrolled > #nlpp > student > sK4_student_enrolled_axiom_Y > sK3_professor_teaches_Y > sK2_course_enrolled_Y > sK1_course_teaches_Y > professor > course > coordinatorof > victor > true > sK7_student_type_A > sK6_professor_type_A > sK5_course_type_A > michael > csc410

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(teaches,type,
    teaches: ( $i * $i ) > $i ).

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

tff(sK2_course_enrolled_Y,type,
    sK2_course_enrolled_Y: $i > $i ).

tff(sK3_professor_teaches_Y,type,
    sK3_professor_teaches_Y: $i > $i ).

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

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

tff(student,type,
    student: $i > $i ).

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

tff(sK1_course_teaches_Y,type,
    sK1_course_teaches_Y: $i > $i ).

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

tff(sK5_course_type_A,type,
    sK5_course_type_A: $i ).

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

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

tff(true,type,
    true: $i ).

tff(sK7_student_type_A,type,
    sK7_student_type_A: $i ).

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

tff(sK6_professor_type_A,type,
    sK6_professor_type_A: $i ).

tff(sK4_student_enrolled_axiom_Y,type,
    sK4_student_enrolled_axiom_Y: $i > $i ).

tff(ifeq,type,
    ifeq: ( $i * $i * $i * $i ) > $i ).

tff(f_56,axiom,
    taughtby(michael,victor) != true,
    file(unknown,unknown) ).

tff(f_24,axiom,
    ! [A,B,C] : ( ifeq(A,A,B,C) = B ),
    file(unknown,unknown) ).

tff(f_29,axiom,
    professor(victor) = true,
    file(unknown,unknown) ).

tff(f_54,axiom,
    coordinatorof(csc410) = victor,
    file(unknown,unknown) ).

tff(f_30,axiom,
    course(csc410) = true,
    file(unknown,unknown) ).

tff(f_50,axiom,
    ! [X] : ( ifeq(course(X),true,teaches(coordinatorof(X),X),true) = true ),
    file(unknown,unknown) ).

tff(f_28,axiom,
    student(michael) = true,
    file(unknown,unknown) ).

tff(f_53,axiom,
    enrolled(michael,csc410) = true,
    file(unknown,unknown) ).

tff(f_52,axiom,
    ! [Z,Y,X] : ( ifeq(teaches(Z,Y),true,ifeq(enrolled(X,Y),true,ifeq(course(Y),true,ifeq(professor(Z),true,ifeq(student(X),true,taughtby(X,Z),true),true),true),true),true) = true ),
    file(unknown,unknown) ).

tff(c_42,plain,
    taughtby(michael,victor) != true,
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3] : ( ifeq(A_1,A_1,B_2,C_3) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_12,plain,
    professor(victor) = true,
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_40,plain,
    coordinatorof(csc410) = victor,
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_14,plain,
    course(csc410) = true,
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_345,plain,
    ! [X_25] : ( ifeq(course(X_25),true,teaches(coordinatorof(X_25),X_25),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_364,plain,
    ifeq(true,true,teaches(coordinatorof(csc410),csc410),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_14,c_345]) ).

tff(c_373,plain,
    teaches(victor,csc410) = true,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_40,c_364]) ).

tff(c_10,plain,
    student(michael) = true,
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_38,plain,
    enrolled(michael,csc410) = true,
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_593,plain,
    ! [Z_30,Y_31,X_32] : ( ifeq(teaches(Z_30,Y_31),true,ifeq(enrolled(X_32,Y_31),true,ifeq(course(Y_31),true,ifeq(professor(Z_30),true,ifeq(student(X_32),true,taughtby(X_32,Z_30),true),true),true),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_639,plain,
    ! [Z_30] : ( ifeq(teaches(Z_30,csc410),true,ifeq(true,true,ifeq(course(csc410),true,ifeq(professor(Z_30),true,ifeq(student(michael),true,taughtby(michael,Z_30),true),true),true),true),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_38,c_593]) ).

tff(c_805,plain,
    ! [Z_33] : ( ifeq(teaches(Z_33,csc410),true,ifeq(professor(Z_33),true,taughtby(michael,Z_33),true),true) = true ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_14,c_10,c_639]) ).

tff(c_815,plain,
    ifeq(true,true,ifeq(professor(victor),true,taughtby(michael,victor),true),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_373,c_805]) ).

tff(c_834,plain,
    taughtby(michael,victor) = true,
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_12,c_815]) ).

tff(c_836,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_42,c_834]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : PUZ131-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.33  % Computer : n006.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  : 300
% 0.12/0.33  % DateTime : Thu Aug  3 17:33:43 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 4.03/2.11  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.03/2.12  
% 4.03/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.03/2.16  
% 4.03/2.16  Inference rules
% 4.03/2.16  ----------------------
% 4.03/2.16  #Ref     : 0
% 4.03/2.16  #Sup     : 255
% 4.03/2.16  #Fact    : 0
% 4.03/2.16  #Define  : 0
% 4.03/2.16  #Split   : 0
% 4.03/2.16  #Chain   : 0
% 4.03/2.16  #Close   : 0
% 4.03/2.16  
% 4.03/2.16  Ordering : KBO
% 4.03/2.16  
% 4.03/2.16  Simplification rules
% 4.03/2.16  ----------------------
% 4.03/2.16  #Subsume      : 0
% 4.03/2.16  #Demod        : 167
% 4.03/2.16  #Tautology    : 168
% 4.03/2.16  #SimpNegUnit  : 1
% 4.03/2.16  #BackRed      : 17
% 4.03/2.16  
% 4.03/2.16  #Partial instantiations: 0
% 4.03/2.16  #Strategies tried      : 1
% 4.03/2.16  
% 4.03/2.16  Timing (in seconds)
% 4.03/2.16  ----------------------
% 4.22/2.16  Preprocessing        : 0.46
% 4.22/2.16  Parsing              : 0.26
% 4.22/2.16  CNF conversion       : 0.02
% 4.22/2.16  Main loop            : 0.56
% 4.22/2.16  Inferencing          : 0.20
% 4.22/2.16  Reduction            : 0.22
% 4.22/2.16  Demodulation         : 0.16
% 4.22/2.16  BG Simplification    : 0.02
% 4.22/2.16  Subsumption          : 0.08
% 4.22/2.16  Abstraction          : 0.02
% 4.22/2.16  MUC search           : 0.00
% 4.22/2.16  Cooper               : 0.00
% 4.22/2.16  Total                : 1.08
% 4.22/2.16  Index Insertion      : 0.00
% 4.22/2.16  Index Deletion       : 0.00
% 4.22/2.16  Index Matching       : 0.00
% 4.22/2.16  BG Taut test         : 0.00
%------------------------------------------------------------------------------