TSTP Solution File: SET076-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET076-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:55:51 EDT 2023
% Result : Unsatisfiable 28.74s 14.45s
% Output : CNFRefutation 28.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 56
% Syntax : Number of formulae : 72 ( 12 unt; 50 typ; 0 def)
% Number of atoms : 35 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 8 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 41 ( 41 usr; 11 con; 0-3 aty)
% Number of variables : 17 (; 17 !; 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 > z > 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(z,type,
z: $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_648,axiom,
~ subclass(unordered_pair(x,y),z),
file(unknown,unknown) ).
tff(f_646,axiom,
member(y,z),
file(unknown,unknown) ).
tff(f_645,axiom,
member(x,z),
file(unknown,unknown) ).
tff(f_62,axiom,
! [X,Y] :
( member(not_subclass_element(X,Y),X)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(f_103,axiom,
! [U,X,Y] :
( ~ member(U,unordered_pair(X,Y))
| ( U = X )
| ( U = Y ) ),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X,Y] :
( ~ member(not_subclass_element(X,Y),Y)
| subclass(X,Y) ),
file(unknown,unknown) ).
tff(c_188,plain,
~ subclass(unordered_pair(x,y),z),
inference(cnfTransformation,[status(thm)],[f_648]) ).
tff(c_186,plain,
member(y,z),
inference(cnfTransformation,[status(thm)],[f_646]) ).
tff(c_184,plain,
member(x,z),
inference(cnfTransformation,[status(thm)],[f_645]) ).
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_62]) ).
tff(c_714,plain,
! [Y_276,U_277,X_278] :
( ( Y_276 = U_277 )
| ( X_278 = U_277 )
| ~ member(U_277,unordered_pair(X_278,Y_276)) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_28917,plain,
! [X_1200,Y_1201,Y_1202] :
( ( not_subclass_element(unordered_pair(X_1200,Y_1201),Y_1202) = Y_1201 )
| ( not_subclass_element(unordered_pair(X_1200,Y_1201),Y_1202) = X_1200 )
| subclass(unordered_pair(X_1200,Y_1201),Y_1202) ),
inference(resolution,[status(thm)],[c_4,c_714]) ).
tff(c_29003,plain,
( ( not_subclass_element(unordered_pair(x,y),z) = y )
| ( not_subclass_element(unordered_pair(x,y),z) = x ) ),
inference(resolution,[status(thm)],[c_28917,c_188]) ).
tff(c_52719,plain,
not_subclass_element(unordered_pair(x,y),z) = x,
inference(splitLeft,[status(thm)],[c_29003]) ).
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_67]) ).
tff(c_52728,plain,
( subclass(unordered_pair(x,y),z)
| ~ member(x,z) ),
inference(superposition,[status(thm),theory(equality)],[c_52719,c_6]) ).
tff(c_52737,plain,
subclass(unordered_pair(x,y),z),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_52728]) ).
tff(c_52739,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_52737]) ).
tff(c_52740,plain,
not_subclass_element(unordered_pair(x,y),z) = y,
inference(splitRight,[status(thm)],[c_29003]) ).
tff(c_52750,plain,
( subclass(unordered_pair(x,y),z)
| ~ member(y,z) ),
inference(superposition,[status(thm),theory(equality)],[c_52740,c_6]) ).
tff(c_52759,plain,
subclass(unordered_pair(x,y),z),
inference(demodulation,[status(thm),theory(equality)],[c_186,c_52750]) ).
tff(c_52761,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_52759]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET076-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.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:15:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 28.74/14.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.74/14.46
% 28.74/14.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 28.84/14.48
% 28.84/14.48 Inference rules
% 28.84/14.48 ----------------------
% 28.84/14.48 #Ref : 1
% 28.84/14.48 #Sup : 13930
% 28.84/14.48 #Fact : 4
% 28.84/14.48 #Define : 0
% 28.84/14.48 #Split : 121
% 28.84/14.48 #Chain : 0
% 28.84/14.48 #Close : 0
% 28.84/14.48
% 28.84/14.48 Ordering : KBO
% 28.84/14.48
% 28.84/14.48 Simplification rules
% 28.84/14.48 ----------------------
% 28.84/14.48 #Subsume : 4063
% 28.84/14.48 #Demod : 5900
% 28.84/14.48 #Tautology : 2171
% 28.84/14.48 #SimpNegUnit : 270
% 28.84/14.48 #BackRed : 130
% 28.84/14.48
% 28.84/14.48 #Partial instantiations: 0
% 28.84/14.48 #Strategies tried : 1
% 28.84/14.48
% 28.84/14.48 Timing (in seconds)
% 28.84/14.48 ----------------------
% 28.84/14.49 Preprocessing : 0.70
% 28.84/14.49 Parsing : 0.38
% 28.84/14.49 CNF conversion : 0.04
% 28.84/14.49 Main loop : 12.62
% 28.84/14.49 Inferencing : 2.16
% 28.84/14.49 Reduction : 5.54
% 28.84/14.49 Demodulation : 3.99
% 28.84/14.49 BG Simplification : 0.13
% 28.84/14.49 Subsumption : 3.63
% 28.84/14.49 Abstraction : 0.15
% 28.84/14.49 MUC search : 0.00
% 28.84/14.49 Cooper : 0.00
% 28.84/14.49 Total : 13.37
% 28.84/14.49 Index Insertion : 0.00
% 28.84/14.49 Index Deletion : 0.00
% 28.84/14.49 Index Matching : 0.00
% 28.84/14.49 BG Taut test : 0.00
%------------------------------------------------------------------------------