TSTP Solution File: SET058-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET058-7 : 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 : n029.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:44 EDT 2023
% Result : Unsatisfiable 4.86s 2.03s
% Output : CNFRefutation 4.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 55
% Syntax : Number of formulae : 66 ( 10 unt; 49 typ; 0 def)
% Number of atoms : 26 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 65 ( 39 >; 26 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 40 ( 40 usr; 10 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ 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 > second > rotate > regular > range_of > power_class > inverse > flip > first > domain_of > diagonalise > complement > cantor > y > x > universal_class > successor_relation > subset_relation > omega > null_class > identity_relation > element_relation > choice
%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(x,type,
x: $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(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(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(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(domain_of,type,
domain_of: $i > $i ).
tff(not_homomorphism2,type,
not_homomorphism2: ( $i * $i * $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_687,axiom,
x != y,
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,Y] :
( member(not_subclass_element(X,Y),X)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(f_689,axiom,
~ member(not_subclass_element(x,y),x),
file(unknown,unknown) ).
tff(f_685,axiom,
member(not_subclass_element(y,x),x),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] :
( ~ member(not_subclass_element(X,Y),Y)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] :
( ~ subclass(X,Y)
| ~ subclass(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(c_198,plain,
y != x,
inference(cnfTransformation,[status(thm)],[f_687]) ).
tff(c_353,plain,
! [X_238,Y_239] :
( subclass(X_238,Y_239)
| member(not_subclass_element(X_238,Y_239),X_238) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_200,plain,
~ member(not_subclass_element(x,y),x),
inference(cnfTransformation,[status(thm)],[f_689]) ).
tff(c_362,plain,
subclass(x,y),
inference(resolution,[status(thm)],[c_353,c_200]) ).
tff(c_196,plain,
member(not_subclass_element(y,x),x),
inference(cnfTransformation,[status(thm)],[f_685]) ).
tff(c_397,plain,
! [X_256,Y_257] :
( subclass(X_256,Y_257)
| ~ member(not_subclass_element(X_256,Y_257),Y_257) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_407,plain,
subclass(y,x),
inference(resolution,[status(thm)],[c_196,c_397]) ).
tff(c_430,plain,
! [Y_261,X_262] :
( ( Y_261 = X_262 )
| ~ subclass(Y_261,X_262)
| ~ subclass(X_262,Y_261) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_432,plain,
( ( y = x )
| ~ subclass(x,y) ),
inference(resolution,[status(thm)],[c_407,c_430]) ).
tff(c_463,plain,
y = x,
inference(demodulation,[status(thm),theory(equality)],[c_362,c_432]) ).
tff(c_465,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_198,c_463]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET058-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 16:38:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.86/2.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.86/2.03
% 4.86/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.86/2.06
% 4.86/2.06 Inference rules
% 4.86/2.06 ----------------------
% 4.86/2.06 #Ref : 0
% 4.86/2.06 #Sup : 63
% 4.86/2.06 #Fact : 0
% 4.86/2.06 #Define : 0
% 4.86/2.06 #Split : 0
% 4.86/2.06 #Chain : 0
% 4.86/2.06 #Close : 0
% 4.86/2.06
% 4.86/2.06 Ordering : KBO
% 4.86/2.06
% 4.86/2.06 Simplification rules
% 4.86/2.06 ----------------------
% 4.86/2.06 #Subsume : 0
% 4.86/2.06 #Demod : 8
% 4.86/2.06 #Tautology : 26
% 4.86/2.06 #SimpNegUnit : 1
% 4.86/2.06 #BackRed : 0
% 4.86/2.06
% 4.86/2.06 #Partial instantiations: 0
% 4.86/2.06 #Strategies tried : 1
% 4.86/2.06
% 4.86/2.06 Timing (in seconds)
% 4.86/2.06 ----------------------
% 4.86/2.06 Preprocessing : 0.71
% 4.86/2.06 Parsing : 0.36
% 4.86/2.06 CNF conversion : 0.05
% 4.86/2.06 Main loop : 0.37
% 4.86/2.06 Inferencing : 0.11
% 4.86/2.06 Reduction : 0.13
% 4.86/2.06 Demodulation : 0.10
% 4.86/2.06 BG Simplification : 0.04
% 4.86/2.06 Subsumption : 0.08
% 4.86/2.06 Abstraction : 0.02
% 4.86/2.06 MUC search : 0.00
% 4.86/2.06 Cooper : 0.00
% 4.86/2.06 Total : 1.12
% 4.86/2.06 Index Insertion : 0.00
% 4.86/2.06 Index Deletion : 0.00
% 4.86/2.06 Index Matching : 0.00
% 4.86/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------