TSTP Solution File: SET017+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.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 : n007.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:55:33 EDT 2023
% Result : Theorem 4.46s 2.34s
% Output : CNFRefutation 5.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 43
% Syntax : Number of formulae : 60 ( 9 unt; 41 typ; 0 def)
% Number of atoms : 36 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 10 ~; 12 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 31 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 10 con; 0-3 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subclass > member > disjoint > inductive > function > restrict > unordered_pair > union > ordered_pair > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > second > rotate > range_of > power_class > inverse > flip > first > domain_of > complement > universal_class > successor_relation > null_class > identity_relation > element_relation > #skF_4 > #skF_7 > #skF_3 > #skF_10 > #skF_2 > #skF_9 > #skF_8 > #skF_1 > #skF_5 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(null_class,type,
null_class: $i ).
tff(rotate,type,
rotate: $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(subclass,type,
subclass: ( $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(sum_class,type,
sum_class: $i > $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(element_relation,type,
element_relation: $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(second,type,
second: $i > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(flip,type,
flip: $i > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(power_class,type,
power_class: $i > $i ).
tff(cross_product,type,
cross_product: ( $i * $i ) > $i ).
tff(restrict,type,
restrict: ( $i * $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(first,type,
first: $i > $i ).
tff(image,type,
image: ( $i * $i ) > $i ).
tff(range_of,type,
range_of: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(inductive,type,
inductive: $i > $o ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(domain_of,type,
domain_of: $i > $i ).
tff(successor,type,
successor: $i > $i ).
tff(successor_relation,type,
successor_relation: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(identity_relation,type,
identity_relation: $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(universal_class,type,
universal_class: $i ).
tff(f_384,negated_conjecture,
~ ! [X,Y,Z] :
( ( member(Y,universal_class)
& member(Z,universal_class)
& ( unordered_pair(X,Y) = unordered_pair(X,Z) ) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
tff(f_87,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( member(U,universal_class)
& ( ( U = X )
| ( U = Y ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
tff(c_180,plain,
'#skF_10' != '#skF_9',
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_184,plain,
member('#skF_10',universal_class),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_182,plain,
unordered_pair('#skF_8','#skF_10') = unordered_pair('#skF_8','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_705,plain,
! [Y_190,X_191] :
( member(Y_190,unordered_pair(X_191,Y_190))
| ~ member(Y_190,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_714,plain,
( member('#skF_10',unordered_pair('#skF_8','#skF_9'))
| ~ member('#skF_10',universal_class) ),
inference(superposition,[status(thm),theory(equality)],[c_182,c_705]) ).
tff(c_717,plain,
member('#skF_10',unordered_pair('#skF_8','#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_714]) ).
tff(c_1208,plain,
! [Y_236,U_237,X_238] :
( ( Y_236 = U_237 )
| ( X_238 = U_237 )
| ~ member(U_237,unordered_pair(X_238,Y_236)) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_1215,plain,
( ( '#skF_10' = '#skF_9' )
| ( '#skF_10' = '#skF_8' ) ),
inference(resolution,[status(thm)],[c_717,c_1208]) ).
tff(c_1247,plain,
'#skF_10' = '#skF_8',
inference(negUnitSimplification,[status(thm)],[c_180,c_1215]) ).
tff(c_1265,plain,
'#skF_9' != '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_1247,c_180]) ).
tff(c_186,plain,
member('#skF_9',universal_class),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_20,plain,
! [Y_11,X_10] :
( member(Y_11,unordered_pair(X_10,Y_11))
| ~ member(Y_11,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_1243,plain,
! [U_237] :
( ( U_237 = '#skF_10' )
| ( U_237 = '#skF_8' )
| ~ member(U_237,unordered_pair('#skF_8','#skF_9')) ),
inference(superposition,[status(thm),theory(equality)],[c_182,c_1208]) ).
tff(c_1275,plain,
! [U_239] :
( ( U_239 = '#skF_8' )
| ( U_239 = '#skF_8' )
| ~ member(U_239,unordered_pair('#skF_8','#skF_9')) ),
inference(demodulation,[status(thm),theory(equality)],[c_1247,c_1243]) ).
tff(c_1283,plain,
( ( '#skF_9' = '#skF_8' )
| ~ member('#skF_9',universal_class) ),
inference(resolution,[status(thm)],[c_20,c_1275]) ).
tff(c_1307,plain,
'#skF_9' = '#skF_8',
inference(demodulation,[status(thm),theory(equality)],[c_186,c_1283]) ).
tff(c_1309,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1265,c_1307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.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.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:27:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.46/2.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.46/2.35
% 4.46/2.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.21/2.38
% 5.21/2.38 Inference rules
% 5.21/2.38 ----------------------
% 5.21/2.38 #Ref : 0
% 5.21/2.38 #Sup : 234
% 5.21/2.38 #Fact : 0
% 5.21/2.38 #Define : 0
% 5.21/2.38 #Split : 6
% 5.21/2.38 #Chain : 0
% 5.21/2.38 #Close : 0
% 5.21/2.38
% 5.21/2.38 Ordering : KBO
% 5.21/2.38
% 5.21/2.38 Simplification rules
% 5.21/2.38 ----------------------
% 5.21/2.38 #Subsume : 37
% 5.21/2.38 #Demod : 35
% 5.21/2.38 #Tautology : 38
% 5.21/2.38 #SimpNegUnit : 2
% 5.21/2.38 #BackRed : 10
% 5.21/2.38
% 5.21/2.38 #Partial instantiations: 0
% 5.21/2.38 #Strategies tried : 1
% 5.21/2.38
% 5.21/2.38 Timing (in seconds)
% 5.21/2.38 ----------------------
% 5.21/2.38 Preprocessing : 0.66
% 5.21/2.38 Parsing : 0.34
% 5.21/2.38 CNF conversion : 0.05
% 5.21/2.38 Main loop : 0.57
% 5.21/2.38 Inferencing : 0.20
% 5.21/2.38 Reduction : 0.17
% 5.21/2.38 Demodulation : 0.12
% 5.21/2.38 BG Simplification : 0.04
% 5.21/2.38 Subsumption : 0.13
% 5.21/2.38 Abstraction : 0.02
% 5.21/2.38 MUC search : 0.00
% 5.21/2.38 Cooper : 0.00
% 5.21/2.38 Total : 1.27
% 5.21/2.38 Index Insertion : 0.00
% 5.21/2.38 Index Deletion : 0.00
% 5.21/2.38 Index Matching : 0.00
% 5.21/2.38 BG Taut test : 0.00
%------------------------------------------------------------------------------