TSTP Solution File: SET108+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET108+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 : n012.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 : Theorem 4.32s 1.98s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 42
% Syntax : Number of formulae : 48 ( 4 unt; 41 typ; 0 def)
% Number of atoms : 17 ( 6 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 17 ( 7 ~; 4 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 51 ( 33 >; 18 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 8 con; 0-3 aty)
% Number of variables : 7 (; 3 !; 4 ?; 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_10 > #skF_8 > #skF_1 > #skF_9 > #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('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
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_9',type,
'#skF_9': ( $i * $i ) > $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_396,negated_conjecture,
~ ! [X] :
? [U,V] :
( ( member(U,universal_class)
& member(V,universal_class)
& ( X = ordered_pair(U,V) ) )
| ( ~ ? [Y,Z] :
( member(Y,universal_class)
& member(Z,universal_class)
& ( X = ordered_pair(Y,Z) ) )
& ( U = X )
& ( V = X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_first_and_second) ).
tff(c_186,plain,
member('#skF_9'('#skF_8','#skF_8'),universal_class),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_184,plain,
member('#skF_10'('#skF_8','#skF_8'),universal_class),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_182,plain,
ordered_pair('#skF_9'('#skF_8','#skF_8'),'#skF_10'('#skF_8','#skF_8')) = '#skF_8',
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_277,plain,
! [U_127,V_128] :
( ( ordered_pair(U_127,V_128) != '#skF_8' )
| ~ member(V_128,universal_class)
| ~ member(U_127,universal_class) ),
inference(cnfTransformation,[status(thm)],[f_396]) ).
tff(c_279,plain,
( ~ member('#skF_10'('#skF_8','#skF_8'),universal_class)
| ~ member('#skF_9'('#skF_8','#skF_8'),universal_class) ),
inference(superposition,[status(thm),theory(equality)],[c_182,c_277]) ).
tff(c_283,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_186,c_184,c_279]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET108+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 : n012.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:07 EDT 2023
% 0.18/0.35 % CPUTime :
% 4.32/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/1.98
% 4.32/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.37/2.00
% 4.37/2.00 Inference rules
% 4.37/2.00 ----------------------
% 4.37/2.00 #Ref : 0
% 4.37/2.00 #Sup : 18
% 4.37/2.00 #Fact : 0
% 4.37/2.00 #Define : 0
% 4.37/2.00 #Split : 1
% 4.37/2.00 #Chain : 0
% 4.37/2.00 #Close : 0
% 4.37/2.00
% 4.37/2.00 Ordering : KBO
% 4.37/2.00
% 4.37/2.00 Simplification rules
% 4.37/2.00 ----------------------
% 4.37/2.00 #Subsume : 2
% 4.37/2.00 #Demod : 3
% 4.37/2.00 #Tautology : 12
% 4.37/2.00 #SimpNegUnit : 0
% 4.37/2.00 #BackRed : 0
% 4.37/2.00
% 4.37/2.00 #Partial instantiations: 0
% 4.37/2.00 #Strategies tried : 1
% 4.37/2.00
% 4.37/2.00 Timing (in seconds)
% 4.37/2.00 ----------------------
% 4.37/2.01 Preprocessing : 0.65
% 4.37/2.01 Parsing : 0.33
% 4.37/2.01 CNF conversion : 0.05
% 4.37/2.01 Main loop : 0.29
% 4.37/2.01 Inferencing : 0.07
% 4.37/2.01 Reduction : 0.10
% 4.37/2.01 Demodulation : 0.07
% 4.37/2.01 BG Simplification : 0.03
% 4.37/2.01 Subsumption : 0.08
% 4.37/2.01 Abstraction : 0.02
% 4.37/2.01 MUC search : 0.00
% 4.37/2.01 Cooper : 0.00
% 4.37/2.01 Total : 0.98
% 4.37/2.01 Index Insertion : 0.00
% 4.37/2.01 Index Deletion : 0.00
% 4.37/2.01 Index Matching : 0.00
% 4.37/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------