TSTP Solution File: SET563-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET563-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/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 : n016.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:35 EDT 2023
% Result : Unsatisfiable 5.24s 2.46s
% Output : CNFRefutation 6.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 66
% Syntax : Number of formulae : 75 ( 10 unt; 61 typ; 0 def)
% Number of atoms : 18 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 51 ( 51 usr; 17 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 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 > xh2 > xh1 > xf3 > xf2 > xf1 > 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(xh1,type,
xh1: $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(xf3,type,
xf3: $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(xf2,type,
xf2: $i ).
tff(cross_product,type,
cross_product: ( $i * $i ) > $i ).
tff(choice,type,
choice: $i ).
tff(subset_relation,type,
subset_relation: $i ).
tff(xh2,type,
xh2: $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(xf1,type,
xf1: $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_782,axiom,
~ subclass(range_of(xh1),domain_of(xh2)),
file(unknown,unknown) ).
tff(f_780,axiom,
compatible(xh2,xf2,xf3),
file(unknown,unknown) ).
tff(f_577,axiom,
! [Xh,Xf1,Xf2] :
( ~ compatible(Xh,Xf1,Xf2)
| ( domain_of(domain_of(Xf1)) = domain_of(Xh) ) ),
file(unknown,unknown) ).
tff(f_779,axiom,
compatible(xh1,xf1,xf2),
file(unknown,unknown) ).
tff(f_583,axiom,
! [Xh,Xf1,Xf2] :
( ~ compatible(Xh,Xf1,Xf2)
| subclass(range_of(Xh),domain_of(domain_of(Xf2))) ),
file(unknown,unknown) ).
tff(c_230,plain,
~ subclass(range_of(xh1),domain_of(xh2)),
inference(cnfTransformation,[status(thm)],[f_782]) ).
tff(c_228,plain,
compatible(xh2,xf2,xf3),
inference(cnfTransformation,[status(thm)],[f_780]) ).
tff(c_816,plain,
! [Xf1_326,Xh_327,Xf2_328] :
( ( domain_of(domain_of(Xf1_326)) = domain_of(Xh_327) )
| ~ compatible(Xh_327,Xf1_326,Xf2_328) ),
inference(cnfTransformation,[status(thm)],[f_577]) ).
tff(c_822,plain,
domain_of(domain_of(xf2)) = domain_of(xh2),
inference(resolution,[status(thm)],[c_228,c_816]) ).
tff(c_226,plain,
compatible(xh1,xf1,xf2),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_1408,plain,
! [Xh_381,Xf2_382,Xf1_383] :
( subclass(range_of(Xh_381),domain_of(domain_of(Xf2_382)))
| ~ compatible(Xh_381,Xf1_383,Xf2_382) ),
inference(cnfTransformation,[status(thm)],[f_583]) ).
tff(c_1410,plain,
subclass(range_of(xh1),domain_of(domain_of(xf2))),
inference(resolution,[status(thm)],[c_226,c_1408]) ).
tff(c_1414,plain,
subclass(range_of(xh1),domain_of(xh2)),
inference(demodulation,[status(thm),theory(equality)],[c_822,c_1410]) ).
tff(c_1416,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_230,c_1414]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET563-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/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.17/0.36 % Computer : n016.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Thu Aug 3 17:26:52 EDT 2023
% 0.17/0.36 % CPUTime :
% 5.24/2.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.24/2.46
% 5.24/2.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.20/2.49
% 6.20/2.49 Inference rules
% 6.20/2.49 ----------------------
% 6.20/2.49 #Ref : 0
% 6.20/2.49 #Sup : 278
% 6.20/2.49 #Fact : 0
% 6.20/2.49 #Define : 0
% 6.20/2.49 #Split : 17
% 6.20/2.49 #Chain : 0
% 6.20/2.49 #Close : 0
% 6.20/2.49
% 6.20/2.49 Ordering : KBO
% 6.20/2.49
% 6.20/2.49 Simplification rules
% 6.20/2.49 ----------------------
% 6.20/2.49 #Subsume : 36
% 6.20/2.49 #Demod : 30
% 6.20/2.49 #Tautology : 68
% 6.20/2.49 #SimpNegUnit : 2
% 6.20/2.49 #BackRed : 4
% 6.20/2.49
% 6.20/2.49 #Partial instantiations: 0
% 6.20/2.49 #Strategies tried : 1
% 6.20/2.49
% 6.20/2.49 Timing (in seconds)
% 6.20/2.49 ----------------------
% 6.20/2.49 Preprocessing : 0.74
% 6.20/2.50 Parsing : 0.39
% 6.20/2.50 CNF conversion : 0.05
% 6.20/2.50 Main loop : 0.67
% 6.20/2.50 Inferencing : 0.23
% 6.20/2.50 Reduction : 0.21
% 6.20/2.50 Demodulation : 0.15
% 6.20/2.50 BG Simplification : 0.05
% 6.20/2.50 Subsumption : 0.14
% 6.20/2.50 Abstraction : 0.02
% 6.20/2.50 MUC search : 0.00
% 6.20/2.50 Cooper : 0.00
% 6.20/2.50 Total : 1.46
% 6.20/2.50 Index Insertion : 0.00
% 6.20/2.50 Index Deletion : 0.00
% 6.20/2.50 Index Matching : 0.00
% 6.20/2.50 BG Taut test : 0.00
%------------------------------------------------------------------------------