TSTP Solution File: SET241-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET241-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 : n009.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:15 EDT 2023
% Result : Unsatisfiable 10.55s 3.60s
% Output : CNFRefutation 10.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 66
% Syntax : Number of formulae : 75 ( 9 unt; 61 typ; 0 def)
% Number of atoms : 19 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 24 (; 24 !; 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 > y > xr > x > v > universal_class > u > 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(xr,type,
xr: $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(x,type,
x: $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(u,type,
u: $i ).
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(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(v,type,
v: $i ).
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_780,axiom,
~ member(v,y),
file(unknown,unknown) ).
tff(f_778,axiom,
member(ordered_pair(u,v),restrict(xr,x,y)),
file(unknown,unknown) ).
tff(f_239,axiom,
! [X,Y,Xr] : ( intersection(cross_product(X,Y),Xr) = restrict(Xr,X,Y) ),
file(unknown,unknown) ).
tff(f_194,axiom,
! [Z,X,Y] :
( ~ member(Z,intersection(X,Y))
| member(Z,X) ),
file(unknown,unknown) ).
tff(f_151,axiom,
! [U,V,X,Y] :
( ~ member(ordered_pair(U,V),cross_product(X,Y))
| member(V,Y) ),
file(unknown,unknown) ).
tff(c_228,plain,
~ member(v,y),
inference(cnfTransformation,[status(thm)],[f_780]) ).
tff(c_226,plain,
member(ordered_pair(u,v),restrict(xr,x,y)),
inference(cnfTransformation,[status(thm)],[f_778]) ).
tff(c_731,plain,
! [X_317,Y_318,Xr_319] : ( intersection(cross_product(X_317,Y_318),Xr_319) = restrict(Xr_319,X_317,Y_318) ),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_42,plain,
! [Z_46,X_47,Y_48] :
( member(Z_46,X_47)
| ~ member(Z_46,intersection(X_47,Y_48)) ),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_6165,plain,
! [Z_674,X_675,Y_676,Xr_677] :
( member(Z_674,cross_product(X_675,Y_676))
| ~ member(Z_674,restrict(Xr_677,X_675,Y_676)) ),
inference(superposition,[status(thm),theory(equality)],[c_731,c_42]) ).
tff(c_6219,plain,
member(ordered_pair(u,v),cross_product(x,y)),
inference(resolution,[status(thm)],[c_226,c_6165]) ).
tff(c_30,plain,
! [V_32,Y_34,U_31,X_33] :
( member(V_32,Y_34)
| ~ member(ordered_pair(U_31,V_32),cross_product(X_33,Y_34)) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_6374,plain,
member(v,y),
inference(resolution,[status(thm)],[c_6219,c_30]) ).
tff(c_6385,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_228,c_6374]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET241-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % 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.35 % Computer : n009.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:00:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 10.55/3.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.55/3.61
% 10.55/3.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.55/3.64
% 10.55/3.64 Inference rules
% 10.55/3.64 ----------------------
% 10.55/3.64 #Ref : 0
% 10.55/3.64 #Sup : 1484
% 10.55/3.64 #Fact : 0
% 10.55/3.64 #Define : 0
% 10.55/3.64 #Split : 57
% 10.55/3.64 #Chain : 0
% 10.55/3.64 #Close : 0
% 10.55/3.64
% 10.55/3.64 Ordering : KBO
% 10.55/3.64
% 10.55/3.64 Simplification rules
% 10.55/3.64 ----------------------
% 10.55/3.64 #Subsume : 279
% 10.55/3.64 #Demod : 399
% 10.55/3.64 #Tautology : 241
% 10.55/3.64 #SimpNegUnit : 13
% 10.55/3.64 #BackRed : 110
% 10.55/3.64
% 10.55/3.64 #Partial instantiations: 0
% 10.55/3.64 #Strategies tried : 1
% 10.55/3.64
% 10.55/3.64 Timing (in seconds)
% 10.55/3.64 ----------------------
% 10.55/3.64 Preprocessing : 0.76
% 10.55/3.64 Parsing : 0.40
% 10.55/3.64 CNF conversion : 0.05
% 10.55/3.64 Main loop : 1.76
% 10.55/3.64 Inferencing : 0.56
% 10.55/3.64 Reduction : 0.60
% 10.55/3.64 Demodulation : 0.42
% 10.55/3.64 BG Simplification : 0.06
% 10.55/3.64 Subsumption : 0.39
% 10.55/3.64 Abstraction : 0.05
% 10.55/3.64 MUC search : 0.00
% 10.55/3.64 Cooper : 0.00
% 10.55/3.64 Total : 2.57
% 10.55/3.64 Index Insertion : 0.00
% 10.55/3.64 Index Deletion : 0.00
% 10.55/3.64 Index Matching : 0.00
% 10.55/3.64 BG Taut test : 0.00
%------------------------------------------------------------------------------