TSTP Solution File: SET081-6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET081-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 : n007.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:52 EDT 2023
% Result : Unsatisfiable 4.76s 2.26s
% Output : CNFRefutation 4.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 53
% Syntax : Number of formulae : 60 ( 8 unt; 49 typ; 0 def)
% Number of atoms : 17 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 10 (; 10 !; 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_646,axiom,
y != x,
file(unknown,unknown) ).
tff(f_644,axiom,
member(y,singleton(x)),
file(unknown,unknown) ).
tff(f_123,axiom,
! [X] : ( unordered_pair(X,X) = singleton(X) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [U,X,Y] :
( ~ member(U,unordered_pair(X,Y))
| ( U = X )
| ( U = Y ) ),
file(unknown,unknown) ).
tff(c_186,plain,
y != x,
inference(cnfTransformation,[status(thm)],[f_646]) ).
tff(c_184,plain,
member(y,singleton(x)),
inference(cnfTransformation,[status(thm)],[f_644]) ).
tff(c_24,plain,
! [X_24] : ( unordered_pair(X_24,X_24) = singleton(X_24) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_862,plain,
! [Y_285,U_286,X_287] :
( ( Y_285 = U_286 )
| ( X_287 = U_286 )
| ~ member(U_286,unordered_pair(X_287,Y_285)) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_986,plain,
! [X_293,U_294] :
( ( X_293 = U_294 )
| ( X_293 = U_294 )
| ~ member(U_294,singleton(X_293)) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_862]) ).
tff(c_1012,plain,
y = x,
inference(resolution,[status(thm)],[c_184,c_986]) ).
tff(c_1023,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_186,c_186,c_1012]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET081-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.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:51:23 EDT 2023
% 0.21/0.36 % CPUTime :
% 4.76/2.26 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.76/2.26
% 4.76/2.26 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.76/2.29
% 4.76/2.29 Inference rules
% 4.76/2.29 ----------------------
% 4.76/2.29 #Ref : 0
% 4.76/2.29 #Sup : 187
% 4.76/2.29 #Fact : 0
% 4.76/2.29 #Define : 0
% 4.76/2.29 #Split : 7
% 4.76/2.29 #Chain : 0
% 4.76/2.29 #Close : 0
% 4.76/2.29
% 4.76/2.29 Ordering : KBO
% 4.76/2.29
% 4.76/2.29 Simplification rules
% 4.76/2.29 ----------------------
% 4.76/2.29 #Subsume : 23
% 4.76/2.29 #Demod : 22
% 4.76/2.29 #Tautology : 49
% 4.76/2.29 #SimpNegUnit : 2
% 4.76/2.29 #BackRed : 1
% 4.76/2.29
% 4.76/2.29 #Partial instantiations: 0
% 4.76/2.29 #Strategies tried : 1
% 4.76/2.29
% 4.76/2.29 Timing (in seconds)
% 4.76/2.29 ----------------------
% 4.76/2.29 Preprocessing : 0.69
% 4.76/2.29 Parsing : 0.36
% 4.76/2.29 CNF conversion : 0.05
% 4.76/2.29 Main loop : 0.53
% 4.76/2.29 Inferencing : 0.17
% 4.76/2.29 Reduction : 0.16
% 4.76/2.29 Demodulation : 0.12
% 4.76/2.29 BG Simplification : 0.04
% 4.76/2.29 Subsumption : 0.12
% 4.76/2.29 Abstraction : 0.02
% 4.76/2.29 MUC search : 0.00
% 4.76/2.29 Cooper : 0.00
% 4.76/2.29 Total : 1.26
% 4.76/2.29 Index Insertion : 0.00
% 4.76/2.29 Index Deletion : 0.00
% 4.76/2.29 Index Matching : 0.00
% 4.76/2.29 BG Taut test : 0.00
%------------------------------------------------------------------------------