TSTP Solution File: SET102+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET102+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/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 : n027.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:58 EDT 2023
% Result : Theorem 6.63s 2.51s
% Output : CNFRefutation 6.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 44
% Syntax : Number of formulae : 51 ( 8 unt; 40 typ; 0 def)
% Number of atoms : 16 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 9 ( 4 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 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 : 19 (; 19 !; 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_97,axiom,
! [X,Y] : member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair) ).
tff(f_103,axiom,
! [X,Y] : ( ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',ordered_pair_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/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
tff(f_378,negated_conjecture,
~ ! [X,Y] : member(unordered_pair(X,singleton(Y)),ordered_pair(X,Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
tff(c_24,plain,
! [X_12,Y_13] : member(unordered_pair(X_12,Y_13),universal_class),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_1997,plain,
! [X_265,Y_266] : ( unordered_pair(singleton(X_265),unordered_pair(X_265,singleton(Y_266))) = ordered_pair(X_265,Y_266) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_20,plain,
! [Y_11,X_10] :
( member(Y_11,unordered_pair(X_10,Y_11))
| ~ member(Y_11,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_2015,plain,
! [X_265,Y_266] :
( member(unordered_pair(X_265,singleton(Y_266)),ordered_pair(X_265,Y_266))
| ~ member(unordered_pair(X_265,singleton(Y_266)),universal_class) ),
inference(superposition,[status(thm),theory(equality)],[c_1997,c_20]) ).
tff(c_2029,plain,
! [X_265,Y_266] : member(unordered_pair(X_265,singleton(Y_266)),ordered_pair(X_265,Y_266)),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_2015]) ).
tff(c_180,plain,
~ member(unordered_pair('#skF_8',singleton('#skF_9')),ordered_pair('#skF_8','#skF_9')),
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_3126,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2029,c_180]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET102+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 16:34:08 EDT 2023
% 0.19/0.34 % CPUTime :
% 6.63/2.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.63/2.52
% 6.63/2.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.63/2.54
% 6.63/2.54 Inference rules
% 6.63/2.54 ----------------------
% 6.63/2.54 #Ref : 0
% 6.63/2.54 #Sup : 638
% 6.63/2.54 #Fact : 0
% 6.63/2.54 #Define : 0
% 6.63/2.54 #Split : 17
% 6.63/2.54 #Chain : 0
% 6.63/2.54 #Close : 0
% 6.63/2.54
% 6.63/2.54 Ordering : KBO
% 6.63/2.54
% 6.63/2.54 Simplification rules
% 6.63/2.54 ----------------------
% 6.63/2.54 #Subsume : 115
% 6.63/2.54 #Demod : 105
% 6.63/2.54 #Tautology : 99
% 6.63/2.54 #SimpNegUnit : 2
% 6.63/2.54 #BackRed : 3
% 6.63/2.54
% 6.63/2.54 #Partial instantiations: 0
% 6.63/2.54 #Strategies tried : 1
% 6.63/2.54
% 6.63/2.54 Timing (in seconds)
% 6.63/2.54 ----------------------
% 6.63/2.54 Preprocessing : 0.65
% 6.63/2.54 Parsing : 0.32
% 6.63/2.54 CNF conversion : 0.05
% 6.63/2.54 Main loop : 0.91
% 6.63/2.54 Inferencing : 0.32
% 6.63/2.54 Reduction : 0.28
% 6.63/2.54 Demodulation : 0.19
% 6.63/2.54 BG Simplification : 0.04
% 6.63/2.54 Subsumption : 0.20
% 6.63/2.54 Abstraction : 0.03
% 6.63/2.55 MUC search : 0.00
% 6.63/2.55 Cooper : 0.00
% 6.63/2.55 Total : 1.60
% 6.63/2.55 Index Insertion : 0.00
% 6.63/2.55 Index Deletion : 0.00
% 6.63/2.55 Index Matching : 0.00
% 6.63/2.55 BG Taut test : 0.00
%------------------------------------------------------------------------------