TSTP Solution File: SET081+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET081+1 : TPTP v8.1.2. Bugfixed v5.4.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 : n021.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 : Theorem 4.83s 2.24s
% Output : CNFRefutation 4.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 43
% Syntax : Number of formulae : 50 ( 6 unt; 40 typ; 0 def)
% Number of atoms : 18 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 4 ~; 5 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 31 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 35 ( 35 usr; 9 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subclass > member > disjoint > inductive > function > restrict > unordered_pair > union > ordered_pair > intersection > image > cross_product > compose > apply > #nlpp > sum_class > successor > singleton > second > rotate > range_of > power_class > inverse > flip > first > domain_of > complement > universal_class > successor_relation > null_class > identity_relation > element_relation > #skF_4 > #skF_7 > #skF_3 > #skF_2 > #skF_9 > #skF_8 > #skF_1 > #skF_5 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(null_class,type,
null_class: $i ).
tff(rotate,type,
rotate: $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(subclass,type,
subclass: ( $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(sum_class,type,
sum_class: $i > $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
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('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $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(restrict,type,
restrict: ( $i * $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(first,type,
first: $i > $i ).
tff(image,type,
image: ( $i * $i ) > $i ).
tff(range_of,type,
range_of: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(inductive,type,
inductive: $i > $o ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(domain_of,type,
domain_of: $i > $i ).
tff(successor,type,
successor: $i > $i ).
tff(successor_relation,type,
successor_relation: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(identity_relation,type,
identity_relation: $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(universal_class,type,
universal_class: $i ).
tff(f_380,negated_conjecture,
~ ! [X,Y] :
( member(Y,singleton(X))
=> ( Y = X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_member_in_singleton) ).
tff(f_100,axiom,
! [X] : ( singleton(X) = unordered_pair(X,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
tff(f_87,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( member(U,universal_class)
& ( ( U = X )
| ( U = Y ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
tff(c_180,plain,
'#skF_9' != '#skF_8',
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_182,plain,
member('#skF_9',singleton('#skF_8')),
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_26,plain,
! [X_14] : ( unordered_pair(X_14,X_14) = singleton(X_14) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_938,plain,
! [Y_221,U_222,X_223] :
( ( Y_221 = U_222 )
| ( X_223 = U_222 )
| ~ member(U_222,unordered_pair(X_223,Y_221)) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_1004,plain,
! [X_225,U_226] :
( ( X_225 = U_226 )
| ( X_225 = U_226 )
| ~ member(U_226,singleton(X_225)) ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_938]) ).
tff(c_1030,plain,
'#skF_9' = '#skF_8',
inference(resolution,[status(thm)],[c_182,c_1004]) ).
tff(c_1041,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_180,c_180,c_1030]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET081+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/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.18/0.35 % Computer : n021.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 16:58:21 EDT 2023
% 0.18/0.35 % CPUTime :
% 4.83/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.83/2.24
% 4.83/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.83/2.27
% 4.83/2.27 Inference rules
% 4.83/2.27 ----------------------
% 4.83/2.27 #Ref : 0
% 4.83/2.27 #Sup : 179
% 4.83/2.27 #Fact : 0
% 4.83/2.27 #Define : 0
% 4.83/2.27 #Split : 7
% 4.83/2.27 #Chain : 0
% 4.83/2.27 #Close : 0
% 4.83/2.27
% 4.83/2.27 Ordering : KBO
% 4.83/2.27
% 4.83/2.27 Simplification rules
% 4.83/2.27 ----------------------
% 4.83/2.27 #Subsume : 30
% 4.83/2.27 #Demod : 8
% 4.83/2.27 #Tautology : 40
% 4.83/2.27 #SimpNegUnit : 1
% 4.83/2.27 #BackRed : 0
% 4.83/2.27
% 4.83/2.27 #Partial instantiations: 0
% 4.83/2.27 #Strategies tried : 1
% 4.83/2.27
% 4.83/2.27 Timing (in seconds)
% 4.83/2.27 ----------------------
% 4.83/2.28 Preprocessing : 0.66
% 4.83/2.28 Parsing : 0.33
% 4.83/2.28 CNF conversion : 0.05
% 4.83/2.28 Main loop : 0.52
% 4.83/2.28 Inferencing : 0.18
% 4.83/2.28 Reduction : 0.15
% 4.83/2.28 Demodulation : 0.10
% 4.83/2.28 BG Simplification : 0.04
% 4.83/2.28 Subsumption : 0.12
% 4.83/2.28 Abstraction : 0.02
% 4.83/2.28 MUC search : 0.00
% 4.83/2.28 Cooper : 0.00
% 4.83/2.28 Total : 1.22
% 4.83/2.28 Index Insertion : 0.00
% 4.83/2.28 Index Deletion : 0.00
% 4.83/2.28 Index Matching : 0.00
% 4.83/2.28 BG Taut test : 0.00
%------------------------------------------------------------------------------