TSTP Solution File: PUZ131_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ131_1 : TPTP v8.1.2. Released v5.0.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 : n001.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 : Theorem 2.38s 1.67s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 28 ( 11 unt; 14 typ; 0 def)
% Number of atoms : 19 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 11 ( 8 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 9 (; 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
%$ teaches > taughtby > enrolled > #nlpp > coordinatorof > victor > michael > csc410 > #skF_2 > #skF_4 > #skF_3 > #skF_1
%Foreground sorts:
tff(course,type,
course: $tType ).
tff(student,type,
student: $tType ).
tff(professor,type,
professor: $tType ).
%Background operators:
%Foreground operators:
tff(enrolled,type,
enrolled: ( student * course ) > $o ).
tff('#skF_2',type,
'#skF_2': professor > course ).
tff(taughtby,type,
taughtby: ( student * professor ) > $o ).
tff(coordinatorof,type,
coordinatorof: course > professor ).
tff(michael,type,
michael: student ).
tff('#skF_4',type,
'#skF_4': course > professor ).
tff('#skF_3',type,
'#skF_3': course > student ).
tff(victor,type,
victor: professor ).
tff(teaches,type,
teaches: ( professor * course ) > $o ).
tff(csc410,type,
csc410: course ).
tff('#skF_1',type,
'#skF_1': student > course ).
tff(f_54,axiom,
enrolled(michael,csc410),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',michael_enrolled_csc410_axiom) ).
tff(f_55,axiom,
coordinatorof(csc410) = victor,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',victor_coordinator_csc410_axiom) ).
tff(f_46,axiom,
! [X: course] : teaches(coordinatorof(X),X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',coordinator_teaches) ).
tff(f_53,axiom,
! [X: student,Y: course] :
( enrolled(X,Y)
=> ! [Z: professor] :
( teaches(Z,Y)
=> taughtby(X,Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',student_enrolled_taught) ).
tff(f_57,negated_conjecture,
~ taughtby(michael,victor),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',teaching_conjecture) ).
tff(c_14,plain,
enrolled(michael,csc410),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_16,plain,
coordinatorof(csc410) = victor,
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_25,plain,
! [X_16: course] : teaches(coordinatorof(X_16),X_16),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_28,plain,
teaches(victor,csc410),
inference(superposition,[status(thm),theory(equality)],[c_16,c_25]) ).
tff(c_31,plain,
! [X_19: student,Z_20: professor,Y_21: course] :
( taughtby(X_19,Z_20)
| ~ teaches(Z_20,Y_21)
| ~ enrolled(X_19,Y_21) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_44,plain,
! [X_22: student] :
( taughtby(X_22,victor)
| ~ enrolled(X_22,csc410) ),
inference(resolution,[status(thm)],[c_28,c_31]) ).
tff(c_18,plain,
~ taughtby(michael,victor),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_47,plain,
~ enrolled(michael,csc410),
inference(resolution,[status(thm)],[c_44,c_18]) ).
tff(c_51,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ131_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:14:10 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.38/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.38/1.68
% 2.38/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.38/1.70
% 2.38/1.70 Inference rules
% 2.38/1.70 ----------------------
% 2.38/1.70 #Ref : 0
% 2.38/1.70 #Sup : 8
% 2.38/1.70 #Fact : 0
% 2.38/1.70 #Define : 0
% 2.38/1.70 #Split : 0
% 2.38/1.70 #Chain : 0
% 2.38/1.70 #Close : 0
% 2.38/1.70
% 2.38/1.70 Ordering : KBO
% 2.38/1.70
% 2.38/1.70 Simplification rules
% 2.38/1.70 ----------------------
% 2.38/1.70 #Subsume : 0
% 2.38/1.70 #Demod : 1
% 2.38/1.70 #Tautology : 2
% 2.38/1.70 #SimpNegUnit : 0
% 2.38/1.70 #BackRed : 0
% 2.38/1.70
% 2.38/1.70 #Partial instantiations: 0
% 2.38/1.70 #Strategies tried : 1
% 2.38/1.70
% 2.38/1.70 Timing (in seconds)
% 2.38/1.70 ----------------------
% 2.38/1.71 Preprocessing : 0.47
% 2.38/1.71 Parsing : 0.28
% 2.38/1.71 CNF conversion : 0.03
% 2.38/1.71 Main loop : 0.17
% 2.38/1.71 Inferencing : 0.08
% 2.38/1.71 Reduction : 0.04
% 2.38/1.71 Demodulation : 0.03
% 2.38/1.71 BG Simplification : 0.01
% 2.38/1.71 Subsumption : 0.03
% 2.38/1.71 Abstraction : 0.01
% 2.38/1.71 MUC search : 0.00
% 2.38/1.71 Cooper : 0.00
% 2.38/1.71 Total : 0.68
% 2.38/1.71 Index Insertion : 0.00
% 2.38/1.71 Index Deletion : 0.00
% 2.38/1.71 Index Matching : 0.00
% 2.38/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------