TSTP Solution File: SET261-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET261-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 : n019.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 13.42s 4.29s
% Output : CNFRefutation 13.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 64
% Syntax : Number of formulae : 87 ( 11 unt; 56 typ; 0 def)
% Number of atoms : 56 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 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 : 46 ( 46 usr; 12 con; 0-3 aty)
% Number of variables : 47 (; 47 !; 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 > 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(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(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_779,axiom,
domain_of(null_class) != null_class,
file(unknown,unknown) ).
tff(f_237,axiom,
! [Xr,X,Y] : ( intersection(Xr,cross_product(X,Y)) = restrict(Xr,X,Y) ),
file(unknown,unknown) ).
tff(f_479,axiom,
! [X] :
( ( X = null_class )
| member(regular(X),X) ),
file(unknown,unknown) ).
tff(f_194,axiom,
! [Z,X,Y] :
( ~ member(Z,intersection(X,Y))
| member(Z,X) ),
file(unknown,unknown) ).
tff(f_80,axiom,
! [X] : subclass(X,universal_class),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y,U] :
( ~ subclass(X,Y)
| ~ member(U,X)
| member(U,Y) ),
file(unknown,unknown) ).
tff(f_216,axiom,
! [Z,X] :
( ~ member(Z,complement(X))
| ~ member(Z,X) ),
file(unknown,unknown) ).
tff(f_250,axiom,
! [X,Z] :
( ( restrict(X,singleton(Z),universal_class) != null_class )
| ~ member(Z,domain_of(X)) ),
file(unknown,unknown) ).
tff(c_226,plain,
domain_of(null_class) != null_class,
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_56,plain,
! [Xr_63,X_64,Y_65] : ( intersection(Xr_63,cross_product(X_64,Y_65)) = restrict(Xr_63,X_64,Y_65) ),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_132,plain,
! [X_131] :
( member(regular(X_131),X_131)
| ( null_class = X_131 ) ),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_371,plain,
! [Z_265,X_266,Y_267] :
( member(Z_265,X_266)
| ~ member(Z_265,intersection(X_266,Y_267)) ),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_3965,plain,
! [X_614,Y_615] :
( member(regular(intersection(X_614,Y_615)),X_614)
| ( intersection(X_614,Y_615) = null_class ) ),
inference(resolution,[status(thm)],[c_132,c_371]) ).
tff(c_8,plain,
! [X_8] : subclass(X_8,universal_class),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_825,plain,
! [U_327,Y_328,X_329] :
( member(U_327,Y_328)
| ~ member(U_327,X_329)
| ~ subclass(X_329,Y_328) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_866,plain,
! [X_131,Y_328] :
( member(regular(X_131),Y_328)
| ~ subclass(X_131,Y_328)
| ( null_class = X_131 ) ),
inference(resolution,[status(thm)],[c_132,c_825]) ).
tff(c_1387,plain,
! [X_382,Y_383] :
( member(regular(X_382),Y_383)
| ~ subclass(X_382,Y_383)
| ( null_class = X_382 ) ),
inference(resolution,[status(thm)],[c_132,c_825]) ).
tff(c_344,plain,
! [Z_257,X_258] :
( ~ member(Z_257,X_258)
| ~ member(Z_257,complement(X_258)) ),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_359,plain,
! [X_258] :
( ~ member(regular(complement(X_258)),X_258)
| ( complement(X_258) = null_class ) ),
inference(resolution,[status(thm)],[c_132,c_344]) ).
tff(c_1442,plain,
! [Y_384] :
( ~ subclass(complement(Y_384),Y_384)
| ( complement(Y_384) = null_class ) ),
inference(resolution,[status(thm)],[c_1387,c_359]) ).
tff(c_1464,plain,
complement(universal_class) = null_class,
inference(resolution,[status(thm)],[c_8,c_1442]) ).
tff(c_48,plain,
! [Z_55,X_56] :
( ~ member(Z_55,X_56)
| ~ member(Z_55,complement(X_56)) ),
inference(cnfTransformation,[status(thm)],[f_216]) ).
tff(c_1501,plain,
! [Z_385] :
( ~ member(Z_385,universal_class)
| ~ member(Z_385,null_class) ),
inference(superposition,[status(thm),theory(equality)],[c_1464,c_48]) ).
tff(c_1505,plain,
! [X_131] :
( ~ member(regular(X_131),null_class)
| ~ subclass(X_131,universal_class)
| ( null_class = X_131 ) ),
inference(resolution,[status(thm)],[c_866,c_1501]) ).
tff(c_1549,plain,
! [X_131] :
( ~ member(regular(X_131),null_class)
| ( null_class = X_131 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_1505]) ).
tff(c_4092,plain,
! [Y_616] : ( intersection(null_class,Y_616) = null_class ),
inference(resolution,[status(thm)],[c_3965,c_1549]) ).
tff(c_4153,plain,
! [X_64,Y_65] : ( restrict(null_class,X_64,Y_65) = null_class ),
inference(superposition,[status(thm),theory(equality)],[c_56,c_4092]) ).
tff(c_1339,plain,
! [Z_378,X_379] :
( ~ member(Z_378,domain_of(X_379))
| ( restrict(X_379,singleton(Z_378),universal_class) != null_class ) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_10578,plain,
! [X_828] :
( ( restrict(X_828,singleton(regular(domain_of(X_828))),universal_class) != null_class )
| ( domain_of(X_828) = null_class ) ),
inference(resolution,[status(thm)],[c_132,c_1339]) ).
tff(c_10582,plain,
domain_of(null_class) = null_class,
inference(superposition,[status(thm),theory(equality)],[c_4153,c_10578]) ).
tff(c_10595,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_226,c_10582]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET261-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.14/0.15 % 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.14/0.36 % Computer : n019.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:41:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 13.42/4.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.42/4.30
% 13.42/4.30 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.42/4.33
% 13.42/4.33 Inference rules
% 13.42/4.33 ----------------------
% 13.42/4.33 #Ref : 0
% 13.42/4.33 #Sup : 2555
% 13.42/4.33 #Fact : 0
% 13.42/4.33 #Define : 0
% 13.42/4.33 #Split : 77
% 13.42/4.33 #Chain : 0
% 13.42/4.33 #Close : 0
% 13.42/4.33
% 13.42/4.33 Ordering : KBO
% 13.42/4.33
% 13.42/4.33 Simplification rules
% 13.42/4.33 ----------------------
% 13.42/4.33 #Subsume : 593
% 13.42/4.33 #Demod : 553
% 13.42/4.33 #Tautology : 378
% 13.42/4.33 #SimpNegUnit : 41
% 13.42/4.33 #BackRed : 109
% 13.42/4.33
% 13.42/4.33 #Partial instantiations: 0
% 13.42/4.33 #Strategies tried : 1
% 13.42/4.33
% 13.42/4.33 Timing (in seconds)
% 13.42/4.33 ----------------------
% 13.42/4.33 Preprocessing : 0.72
% 13.42/4.33 Parsing : 0.38
% 13.42/4.33 CNF conversion : 0.05
% 13.42/4.33 Main loop : 2.53
% 13.42/4.33 Inferencing : 0.76
% 13.42/4.33 Reduction : 0.90
% 13.42/4.33 Demodulation : 0.60
% 13.42/4.33 BG Simplification : 0.07
% 13.42/4.33 Subsumption : 0.59
% 13.42/4.33 Abstraction : 0.06
% 13.42/4.33 MUC search : 0.00
% 13.42/4.33 Cooper : 0.00
% 13.42/4.33 Total : 3.31
% 13.42/4.33 Index Insertion : 0.00
% 13.42/4.33 Index Deletion : 0.00
% 13.42/4.33 Index Matching : 0.00
% 13.42/4.33 BG Taut test : 0.00
%------------------------------------------------------------------------------