TSTP Solution File: SET021-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET021-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/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 : n023.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:35 EDT 2023
% Result : Unsatisfiable 37.91s 23.86s
% Output : CNFRefutation 37.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 56
% Syntax : Number of formulae : 67 ( 8 unt; 51 typ; 0 def)
% Number of atoms : 26 ( 14 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 67 ( 41 >; 26 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 42 ( 42 usr; 10 con; 0-3 aty)
% Number of variables : 27 (; 27 !; 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 > member_of1 > member_of > inverse > flip > first > domain_of > diagonalise > complement > cantor > v > universal_class > u > 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(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(u,type,
u: $i ).
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(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(member_of1,type,
member_of1: $i > $i ).
tff(v,type,
v: $i ).
tff(not_subclass_element,type,
not_subclass_element: ( $i * $i ) > $i ).
tff(member_of,type,
member_of: $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_1047,axiom,
second(ordered_pair(u,v)) != v,
file(unknown,unknown) ).
tff(f_1045,axiom,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file(unknown,unknown) ).
tff(f_159,axiom,
! [Z,X,Y] :
( ~ member(Z,cross_product(X,Y))
| ( ordered_pair(first(Z),second(Z)) = Z ) ),
file(unknown,unknown) ).
tff(f_665,axiom,
! [U,V,X,Y] :
( ~ member(ordered_pair(U,V),cross_product(X,Y))
| member(V,universal_class) ),
file(unknown,unknown) ).
tff(f_1016,axiom,
! [W,X,Y,Z] :
( ( ordered_pair(W,X) != ordered_pair(Y,Z) )
| ~ member(X,universal_class)
| ( X = Z ) ),
file(unknown,unknown) ).
tff(c_318,plain,
second(ordered_pair(u,v)) != v,
inference(cnfTransformation,[status(thm)],[f_1047]) ).
tff(c_316,plain,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
inference(cnfTransformation,[status(thm)],[f_1045]) ).
tff(c_5482,plain,
! [Z_597,X_598,Y_599] :
( ( ordered_pair(first(Z_597),second(Z_597)) = Z_597 )
| ~ member(Z_597,cross_product(X_598,Y_599)) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_5523,plain,
ordered_pair(first(ordered_pair(u,v)),second(ordered_pair(u,v))) = ordered_pair(u,v),
inference(resolution,[status(thm)],[c_316,c_5482]) ).
tff(c_4242,plain,
! [V_549,U_550,X_551,Y_552] :
( member(V_549,universal_class)
| ~ member(ordered_pair(U_550,V_549),cross_product(X_551,Y_552)) ),
inference(cnfTransformation,[status(thm)],[f_665]) ).
tff(c_4257,plain,
member(v,universal_class),
inference(resolution,[status(thm)],[c_316,c_4242]) ).
tff(c_6050,plain,
! [Z_613,X_614,Y_615,W_616] :
( ( Z_613 = X_614 )
| ~ member(X_614,universal_class)
| ( ordered_pair(Y_615,Z_613) != ordered_pair(W_616,X_614) ) ),
inference(cnfTransformation,[status(thm)],[f_1016]) ).
tff(c_6130,plain,
! [Z_613,Y_615,W_616] :
( ( v = Z_613 )
| ( ordered_pair(Y_615,Z_613) != ordered_pair(W_616,v) ) ),
inference(resolution,[status(thm)],[c_4257,c_6050]) ).
tff(c_96548,plain,
! [W_616] :
( ( second(ordered_pair(u,v)) = v )
| ( ordered_pair(u,v) != ordered_pair(W_616,v) ) ),
inference(superposition,[status(thm),theory(equality)],[c_5523,c_6130]) ).
tff(c_96649,plain,
! [W_616] : ( ordered_pair(u,v) != ordered_pair(W_616,v) ),
inference(negUnitSimplification,[status(thm)],[c_318,c_96548]) ).
tff(c_96794,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_96649]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET021-7 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/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.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:19:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 37.91/23.86 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 37.91/23.87
% 37.91/23.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 37.96/23.90
% 37.96/23.90 Inference rules
% 37.96/23.90 ----------------------
% 37.96/23.90 #Ref : 41
% 37.96/23.90 #Sup : 24589
% 37.96/23.90 #Fact : 12
% 37.96/23.90 #Define : 0
% 37.96/23.90 #Split : 122
% 37.96/23.90 #Chain : 0
% 37.96/23.90 #Close : 0
% 37.96/23.90
% 37.96/23.90 Ordering : KBO
% 37.96/23.90
% 37.96/23.90 Simplification rules
% 37.96/23.90 ----------------------
% 37.96/23.90 #Subsume : 7104
% 37.96/23.90 #Demod : 11516
% 37.96/23.90 #Tautology : 6043
% 37.96/23.90 #SimpNegUnit : 1995
% 37.96/23.90 #BackRed : 460
% 37.96/23.90
% 37.96/23.90 #Partial instantiations: 0
% 37.96/23.90 #Strategies tried : 1
% 37.96/23.90
% 37.96/23.90 Timing (in seconds)
% 37.96/23.90 ----------------------
% 37.96/23.90 Preprocessing : 0.78
% 37.96/23.90 Parsing : 0.36
% 37.96/23.90 CNF conversion : 0.06
% 37.96/23.90 Main loop : 22.05
% 37.96/23.90 Inferencing : 3.15
% 37.96/23.90 Reduction : 10.11
% 37.96/23.90 Demodulation : 7.31
% 37.96/23.90 BG Simplification : 0.17
% 37.96/23.90 Subsumption : 6.85
% 37.96/23.90 Abstraction : 0.24
% 37.96/23.90 MUC search : 0.00
% 37.96/23.90 Cooper : 0.00
% 37.96/23.90 Total : 22.88
% 37.96/23.90 Index Insertion : 0.00
% 37.96/23.90 Index Deletion : 0.00
% 37.96/23.90 Index Matching : 0.00
% 37.96/23.90 BG Taut test : 0.00
%------------------------------------------------------------------------------