TSTP Solution File: SET104-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET104-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 : 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:55:59 EDT 2023
% Result : Unsatisfiable 7.75s 2.97s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 56
% Syntax : Number of formulae : 66 ( 11 unt; 51 typ; 0 def)
% Number of atoms : 19 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 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 : 13 (; 13 !; 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 > 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(member_of1,type,
member_of1: $i > $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_848,axiom,
! [X] :
( member(X,universal_class)
| ( singleton(X) = null_class ) ),
file(unknown,unknown) ).
tff(f_987,axiom,
~ member(x,universal_class),
file(unknown,unknown) ).
tff(f_758,axiom,
! [X,Y] :
( member(X,universal_class)
| ( unordered_pair(X,Y) = singleton(Y) ) ),
file(unknown,unknown) ).
tff(f_129,axiom,
! [X,Y] : ( unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y) ),
file(unknown,unknown) ).
tff(f_985,axiom,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
file(unknown,unknown) ).
tff(c_394,plain,
! [X_314] :
( ( singleton(X_314) = null_class )
| member(X_314,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_848]) ).
tff(c_298,plain,
~ member(x,universal_class),
inference(cnfTransformation,[status(thm)],[f_987]) ).
tff(c_398,plain,
singleton(x) = null_class,
inference(resolution,[status(thm)],[c_394,c_298]) ).
tff(c_1692,plain,
! [X_428,Y_429] :
( ( unordered_pair(X_428,Y_429) = singleton(Y_429) )
| member(X_428,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_758]) ).
tff(c_1796,plain,
! [Y_429] : ( unordered_pair(x,Y_429) = singleton(Y_429) ),
inference(resolution,[status(thm)],[c_1692,c_298]) ).
tff(c_4582,plain,
! [X_540,Y_541] : ( unordered_pair(singleton(X_540),unordered_pair(X_540,singleton(Y_541))) = ordered_pair(X_540,Y_541) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_4675,plain,
! [Y_541] : ( unordered_pair(singleton(x),singleton(singleton(Y_541))) = ordered_pair(x,Y_541) ),
inference(superposition,[status(thm),theory(equality)],[c_1796,c_4582]) ).
tff(c_4737,plain,
! [Y_541] : ( unordered_pair(null_class,singleton(singleton(Y_541))) = ordered_pair(x,Y_541) ),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_4675]) ).
tff(c_296,plain,
unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
inference(cnfTransformation,[status(thm)],[f_985]) ).
tff(c_5000,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4737,c_296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET104-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/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 : n009.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 16:03:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.75/2.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.75/2.97
% 7.75/2.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.75/3.00
% 7.75/3.00 Inference rules
% 7.75/3.00 ----------------------
% 7.75/3.00 #Ref : 3
% 7.75/3.00 #Sup : 1187
% 7.75/3.00 #Fact : 2
% 7.75/3.00 #Define : 0
% 7.75/3.00 #Split : 11
% 7.75/3.00 #Chain : 0
% 7.75/3.00 #Close : 0
% 7.75/3.00
% 7.75/3.00 Ordering : KBO
% 7.75/3.00
% 7.75/3.00 Simplification rules
% 7.75/3.00 ----------------------
% 7.75/3.00 #Subsume : 267
% 7.75/3.00 #Demod : 330
% 7.75/3.00 #Tautology : 363
% 7.75/3.00 #SimpNegUnit : 27
% 7.75/3.00 #BackRed : 19
% 7.75/3.00
% 7.75/3.00 #Partial instantiations: 0
% 7.75/3.00 #Strategies tried : 1
% 7.75/3.00
% 7.75/3.00 Timing (in seconds)
% 7.75/3.00 ----------------------
% 7.75/3.01 Preprocessing : 0.76
% 7.75/3.01 Parsing : 0.35
% 7.75/3.01 CNF conversion : 0.06
% 7.75/3.01 Main loop : 1.18
% 7.75/3.01 Inferencing : 0.36
% 7.75/3.01 Reduction : 0.42
% 7.75/3.01 Demodulation : 0.30
% 7.75/3.01 BG Simplification : 0.06
% 7.75/3.01 Subsumption : 0.26
% 7.75/3.01 Abstraction : 0.04
% 7.75/3.01 MUC search : 0.00
% 7.75/3.01 Cooper : 0.00
% 7.75/3.01 Total : 1.99
% 7.75/3.01 Index Insertion : 0.00
% 7.75/3.01 Index Deletion : 0.00
% 7.75/3.01 Index Matching : 0.00
% 7.75/3.01 BG Taut test : 0.00
%------------------------------------------------------------------------------