TSTP Solution File: SET257-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET257-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:56:16 EDT 2023
% Result : Unsatisfiable 238.94s 210.06s
% Output : CNFRefutation 238.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 65
% Syntax : Number of formulae : 81 ( 9 unt; 58 typ; 0 def)
% Number of atoms : 42 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 72 ( 44 >; 28 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 48 ( 48 usr; 14 con; 0-3 aty)
% Number of variables : 46 (; 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ maps > homomorphism > compatible > subclass > member > single_valued_class > operation > one_to_one > inductive > function > restrict > range > not_homomorphism2 > not_homomorphism1 > domain > unordered_pair > union > symmetric_difference > ordered_pair > not_subclass_element > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > single_valued3 > single_valued2 > single_valued1 > second > rotate > regular > range_of > power_class > inverse > flip > first > domain_of > diagonalise > compose_class > complement > cantor > y > x > universal_class > successor_relation > subset_relation > singleton_relation > omega > null_class > identity_relation > element_relation > domain_relation > composition_function > choice > application_function
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(omega,type,
omega: $i ).
tff(null_class,type,
null_class: $i ).
tff(rotate,type,
rotate: $i > $i ).
tff(subclass,type,
subclass: ( $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(single_valued_class,type,
single_valued_class: $i > $o ).
tff(operation,type,
operation: $i > $o ).
tff(sum_class,type,
sum_class: $i > $i ).
tff(single_valued3,type,
single_valued3: $i > $i ).
tff(x,type,
x: $i ).
tff(maps,type,
maps: ( $i * $i * $i ) > $o ).
tff(compose_class,type,
compose_class: $i > $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(compatible,type,
compatible: ( $i * $i * $i ) > $o ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(regular,type,
regular: $i > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(singleton_relation,type,
singleton_relation: $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(one_to_one,type,
one_to_one: $i > $o ).
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(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(application_function,type,
application_function: $i ).
tff(flip,type,
flip: $i > $i ).
tff(power_class,type,
power_class: $i > $i ).
tff(cross_product,type,
cross_product: ( $i * $i ) > $i ).
tff(choice,type,
choice: $i ).
tff(y,type,
y: $i ).
tff(subset_relation,type,
subset_relation: $i ).
tff(restrict,type,
restrict: ( $i * $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(not_subclass_element,type,
not_subclass_element: ( $i * $i ) > $i ).
tff(range,type,
range: ( $i * $i * $i ) > $i ).
tff(first,type,
first: $i > $i ).
tff(diagonalise,type,
diagonalise: $i > $i ).
tff(homomorphism,type,
homomorphism: ( $i * $i * $i ) > $o ).
tff(single_valued2,type,
single_valued2: $i > $i ).
tff(cantor,type,
cantor: $i > $i ).
tff(image,type,
image: ( $i * $i ) > $i ).
tff(range_of,type,
range_of: $i > $i ).
tff(inductive,type,
inductive: $i > $o ).
tff(domain,type,
domain: ( $i * $i * $i ) > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(composition_function,type,
composition_function: $i ).
tff(domain_of,type,
domain_of: $i > $i ).
tff(domain_relation,type,
domain_relation: $i ).
tff(not_homomorphism2,type,
not_homomorphism2: ( $i * $i * $i ) > $i ).
tff(single_valued1,type,
single_valued1: $i > $i ).
tff(successor,type,
successor: $i > $i ).
tff(successor_relation,type,
successor_relation: $i ).
tff(identity_relation,type,
identity_relation: $i ).
tff(not_homomorphism1,type,
not_homomorphism1: ( $i * $i * $i ) > $i ).
tff(universal_class,type,
universal_class: $i ).
tff(f_71,axiom,
! [X,Y] :
( member(not_subclass_element(X,Y),X)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(f_209,axiom,
! [Z,X,Y] :
( ~ member(Z,X)
| ~ member(Z,Y)
| member(Z,intersection(X,Y)) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X,Y] :
( ~ member(not_subclass_element(X,Y),Y)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(f_195,axiom,
! [Z,X,Y] :
( ~ member(Z,intersection(X,Y))
| member(Z,X) ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [X,Y] :
( ~ subclass(X,Y)
| ~ subclass(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_240,axiom,
! [X,Y,Xr] : ( intersection(cross_product(X,Y),Xr) = restrict(Xr,X,Y) ),
file(unknown,unknown) ).
tff(f_780,axiom,
restrict(cross_product(x,y),x,y) != cross_product(x,y),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4,Y_5] :
( subclass(X_4,Y_5)
| member(not_subclass_element(X_4,Y_5),X_4) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_2012,plain,
! [Z_428,X_429,Y_430] :
( member(Z_428,intersection(X_429,Y_430))
| ~ member(Z_428,Y_430)
| ~ member(Z_428,X_429) ),
inference(cnfTransformation,[status(thm)],[f_209]) ).
tff(c_6,plain,
! [X_6,Y_7] :
( subclass(X_6,Y_7)
| ~ member(not_subclass_element(X_6,Y_7),Y_7) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_817848,plain,
! [X_19235,X_19236,Y_19237] :
( subclass(X_19235,intersection(X_19236,Y_19237))
| ~ member(not_subclass_element(X_19235,intersection(X_19236,Y_19237)),Y_19237)
| ~ member(not_subclass_element(X_19235,intersection(X_19236,Y_19237)),X_19236) ),
inference(resolution,[status(thm)],[c_2012,c_6]) ).
tff(c_835323,plain,
! [X_19705,X_19706] :
( ~ member(not_subclass_element(X_19705,intersection(X_19706,X_19705)),X_19706)
| subclass(X_19705,intersection(X_19706,X_19705)) ),
inference(resolution,[status(thm)],[c_4,c_817848]) ).
tff(c_835542,plain,
! [X_19707] : subclass(X_19707,intersection(X_19707,X_19707)),
inference(resolution,[status(thm)],[c_4,c_835323]) ).
tff(c_482,plain,
! [Z_291,X_292,Y_293] :
( member(Z_291,X_292)
| ~ member(Z_291,intersection(X_292,Y_293)) ),
inference(cnfTransformation,[status(thm)],[f_195]) ).
tff(c_575338,plain,
! [X_13664,Y_13665,Y_13666] :
( member(not_subclass_element(intersection(X_13664,Y_13665),Y_13666),X_13664)
| subclass(intersection(X_13664,Y_13665),Y_13666) ),
inference(resolution,[status(thm)],[c_4,c_482]) ).
tff(c_575493,plain,
! [X_13667,Y_13668] : subclass(intersection(X_13667,Y_13668),X_13667),
inference(resolution,[status(thm)],[c_575338,c_6]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ( Y_14 = X_13 )
| ~ subclass(Y_14,X_13)
| ~ subclass(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_575566,plain,
! [X_13667,Y_13668] :
( ( intersection(X_13667,Y_13668) = X_13667 )
| ~ subclass(X_13667,intersection(X_13667,Y_13668)) ),
inference(resolution,[status(thm)],[c_575493,c_14]) ).
tff(c_835824,plain,
! [X_19708] : ( intersection(X_19708,X_19708) = X_19708 ),
inference(resolution,[status(thm)],[c_835542,c_575566]) ).
tff(c_58,plain,
! [X_66,Y_67,Xr_68] : ( intersection(cross_product(X_66,Y_67),Xr_68) = restrict(Xr_68,X_66,Y_67) ),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_836065,plain,
! [X_66,Y_67] : ( restrict(cross_product(X_66,Y_67),X_66,Y_67) = cross_product(X_66,Y_67) ),
inference(superposition,[status(thm),theory(equality)],[c_835824,c_58]) ).
tff(c_226,plain,
restrict(cross_product(x,y),x,y) != cross_product(x,y),
inference(cnfTransformation,[status(thm)],[f_780]) ).
tff(c_836962,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_836065,c_226]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET257-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.35 % Computer : n001.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:01:25 EDT 2023
% 0.15/0.36 % CPUTime :
% 238.94/210.06 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 238.94/210.07
% 238.94/210.07 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 238.94/210.10
% 238.94/210.10 Inference rules
% 238.94/210.10 ----------------------
% 238.94/210.10 #Ref : 8
% 238.94/210.10 #Sup : 224507
% 238.94/210.10 #Fact : 78
% 238.94/210.10 #Define : 0
% 238.94/210.10 #Split : 1557
% 238.94/210.10 #Chain : 0
% 238.94/210.10 #Close : 0
% 238.94/210.10
% 238.94/210.10 Ordering : KBO
% 238.94/210.10
% 238.94/210.10 Simplification rules
% 238.94/210.10 ----------------------
% 238.94/210.10 #Subsume : 65492
% 238.94/210.10 #Demod : 98700
% 238.94/210.10 #Tautology : 31641
% 238.94/210.10 #SimpNegUnit : 5168
% 238.94/210.10 #BackRed : 2290
% 238.94/210.10
% 238.94/210.10 #Partial instantiations: 0
% 238.94/210.10 #Strategies tried : 1
% 238.94/210.10
% 238.94/210.10 Timing (in seconds)
% 238.94/210.10 ----------------------
% 238.94/210.10 Preprocessing : 0.79
% 238.94/210.10 Parsing : 0.41
% 238.94/210.10 CNF conversion : 0.05
% 238.94/210.10 Main loop : 208.15
% 238.94/210.10 Inferencing : 26.46
% 238.94/210.10 Reduction : 95.13
% 238.94/210.10 Demodulation : 68.68
% 238.94/210.10 BG Simplification : 1.01
% 238.94/210.10 Subsumption : 65.23
% 238.94/210.10 Abstraction : 1.75
% 238.94/210.10 MUC search : 0.00
% 238.94/210.10 Cooper : 0.00
% 238.94/210.10 Total : 209.00
% 238.94/210.10 Index Insertion : 0.00
% 238.94/210.10 Index Deletion : 0.00
% 238.94/210.10 Index Matching : 0.00
% 238.94/210.11 BG Taut test : 0.00
%------------------------------------------------------------------------------