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 v4.1.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 : n011.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:16 EDT 2023
% Result : Theorem 3.14s 1.77s
% Output : CNFRefutation 3.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of formulae : 39 ( 14 unt; 17 typ; 0 def)
% Number of atoms : 42 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 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 : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ teaches > taughtby > enrolled > student > professor > course > #nlpp > coordinatorof > victor > michael > csc410 > #skF_7 > #skF_5 > #skF_4 > #skF_2 > #skF_3 > #skF_1 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(student,type,
student: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(teaches,type,
teaches: ( $i * $i ) > $o ).
tff(enrolled,type,
enrolled: ( $i * $i ) > $o ).
tff(coordinatorof,type,
coordinatorof: $i > $i ).
tff(michael,type,
michael: $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(taughtby,type,
taughtby: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(csc410,type,
csc410: $i ).
tff(professor,type,
professor: $i > $o ).
tff(victor,type,
victor: $i ).
tff(course,type,
course: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_37,axiom,
student(michael),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',michael_type) ).
tff(f_89,axiom,
enrolled(michael,csc410),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',michael_enrolled_csc410_axiom) ).
tff(f_39,axiom,
course(csc410),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',csc410_type) ).
tff(f_38,axiom,
professor(victor),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',victor_type) ).
tff(f_90,axiom,
coordinatorof(csc410) = victor,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',victor_coordinator_csc410_axiom) ).
tff(f_75,axiom,
! [X] :
( course(X)
=> teaches(coordinatorof(X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',coordinator_teaches) ).
tff(f_88,axiom,
! [X,Y] :
( ( student(X)
& course(Y) )
=> ( enrolled(X,Y)
=> ! [Z] :
( professor(Z)
=> ( teaches(Z,Y)
=> taughtby(X,Z) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',student_enrolled_taught) ).
tff(f_92,negated_conjecture,
~ taughtby(michael,victor),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',teaching_conjecture) ).
tff(c_8,plain,
student(michael),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_36,plain,
enrolled(michael,csc410),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_12,plain,
course(csc410),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_10,plain,
professor(victor),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_38,plain,
coordinatorof(csc410) = victor,
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_58,plain,
! [X_23] :
( teaches(coordinatorof(X_23),X_23)
| ~ course(X_23) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_61,plain,
( teaches(victor,csc410)
| ~ course(csc410) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_58]) ).
tff(c_63,plain,
teaches(victor,csc410),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_61]) ).
tff(c_65,plain,
! [X_25,Z_26,Y_27] :
( taughtby(X_25,Z_26)
| ~ teaches(Z_26,Y_27)
| ~ professor(Z_26)
| ~ enrolled(X_25,Y_27)
| ~ course(Y_27)
| ~ student(X_25) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_67,plain,
! [X_25] :
( taughtby(X_25,victor)
| ~ professor(victor)
| ~ enrolled(X_25,csc410)
| ~ course(csc410)
| ~ student(X_25) ),
inference(resolution,[status(thm)],[c_63,c_65]) ).
tff(c_80,plain,
! [X_28] :
( taughtby(X_28,victor)
| ~ enrolled(X_28,csc410)
| ~ student(X_28) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_10,c_67]) ).
tff(c_40,plain,
~ taughtby(michael,victor),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_83,plain,
( ~ enrolled(michael,csc410)
| ~ student(michael) ),
inference(resolution,[status(thm)],[c_80,c_40]) ).
tff(c_87,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_36,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PUZ131+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:38:21 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.14/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.14/1.77
% 3.14/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.14/1.80
% 3.14/1.80 Inference rules
% 3.14/1.80 ----------------------
% 3.14/1.80 #Ref : 0
% 3.14/1.80 #Sup : 9
% 3.14/1.80 #Fact : 0
% 3.14/1.80 #Define : 0
% 3.14/1.80 #Split : 0
% 3.14/1.80 #Chain : 0
% 3.14/1.80 #Close : 0
% 3.14/1.80
% 3.14/1.80 Ordering : KBO
% 3.14/1.80
% 3.14/1.80 Simplification rules
% 3.14/1.80 ----------------------
% 3.14/1.80 #Subsume : 0
% 3.14/1.80 #Demod : 7
% 3.14/1.80 #Tautology : 3
% 3.14/1.80 #SimpNegUnit : 0
% 3.14/1.80 #BackRed : 0
% 3.14/1.80
% 3.14/1.80 #Partial instantiations: 0
% 3.14/1.80 #Strategies tried : 1
% 3.14/1.80
% 3.14/1.80 Timing (in seconds)
% 3.14/1.80 ----------------------
% 3.14/1.80 Preprocessing : 0.47
% 3.14/1.80 Parsing : 0.26
% 3.14/1.80 CNF conversion : 0.03
% 3.14/1.80 Main loop : 0.23
% 3.14/1.80 Inferencing : 0.11
% 3.14/1.80 Reduction : 0.06
% 3.14/1.80 Demodulation : 0.04
% 3.14/1.80 BG Simplification : 0.01
% 3.14/1.80 Subsumption : 0.04
% 3.14/1.80 Abstraction : 0.01
% 3.14/1.80 MUC search : 0.00
% 3.14/1.80 Cooper : 0.00
% 3.14/1.80 Total : 0.75
% 3.14/1.80 Index Insertion : 0.00
% 3.14/1.80 Index Deletion : 0.00
% 3.14/1.80 Index Matching : 0.00
% 3.14/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------