TSTP Solution File: SET813+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET813+4 : TPTP v8.1.2. Released v3.2.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 : n013.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:57:03 EDT 2023
% Result : Theorem 5.25s 2.29s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 39
% Syntax : Number of formulae : 46 ( 4 unt; 35 typ; 0 def)
% Number of atoms : 19 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 6 ~; 4 |; 0 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 31 >; 29 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 27 ( 27 usr; 4 con; 0-3 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ least > apply > subset > strict_well_order > strict_order > member > equal_set > set > initial_segment > unordered_pair > union > intersection > difference > #nlpp > sum > suc > singleton > product > power_set > on > member_predicate > empty_set > #skF_11 > #skF_6 > #skF_4 > #skF_3 > #skF_13 > #skF_12 > #skF_14 > #skF_10 > #skF_7 > #skF_2 > #skF_8 > #skF_1 > #skF_9 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(equal_set,type,
equal_set: ( $i * $i ) > $o ).
tff(strict_well_order,type,
strict_well_order: ( $i * $i ) > $o ).
tff(power_set,type,
power_set: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(product,type,
product: $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(apply,type,
apply: ( $i * $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff(on,type,
on: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(initial_segment,type,
initial_segment: ( $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(strict_order,type,
strict_order: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff(set,type,
set: $i > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff(suc,type,
suc: $i > $i ).
tff(least,type,
least: ( $i * $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff(member_predicate,type,
member_predicate: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_92,axiom,
! [X,A] :
( member(X,singleton(A))
<=> ( X = A ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
tff(f_78,axiom,
! [X,A,B] :
( member(X,union(A,B))
<=> ( member(X,A)
| member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
tff(f_219,axiom,
! [A,X] :
( member(X,suc(A))
<=> member(X,union(A,singleton(A))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',successor) ).
tff(f_226,negated_conjecture,
~ ! [A] :
( member(A,on)
=> member(A,suc(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thV12) ).
tff(c_40,plain,
! [X_20] : member(X_20,singleton(X_20)),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_26,plain,
! [X_13,B_15,A_14] :
( ~ member(X_13,B_15)
| member(X_13,union(A_14,B_15)) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_1429,plain,
! [X_260,A_261] :
( member(X_260,suc(A_261))
| ~ member(X_260,union(A_261,singleton(A_261))) ),
inference(cnfTransformation,[status(thm)],[f_219]) ).
tff(c_1550,plain,
! [X_267,A_268] :
( member(X_267,suc(A_268))
| ~ member(X_267,singleton(A_268)) ),
inference(resolution,[status(thm)],[c_26,c_1429]) ).
tff(c_158,plain,
~ member('#skF_14',suc('#skF_14')),
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_1567,plain,
~ member('#skF_14',singleton('#skF_14')),
inference(resolution,[status(thm)],[c_1550,c_158]) ).
tff(c_1576,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_1567]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SET813+4 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.15 % 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 : n013.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:34:17 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.25/2.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.25/2.29
% 5.25/2.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.25/2.32
% 5.25/2.32 Inference rules
% 5.25/2.32 ----------------------
% 5.25/2.32 #Ref : 0
% 5.25/2.32 #Sup : 289
% 5.25/2.32 #Fact : 0
% 5.25/2.32 #Define : 0
% 5.25/2.32 #Split : 6
% 5.25/2.32 #Chain : 0
% 5.25/2.32 #Close : 0
% 5.25/2.32
% 5.25/2.32 Ordering : KBO
% 5.25/2.32
% 5.25/2.32 Simplification rules
% 5.25/2.32 ----------------------
% 5.25/2.32 #Subsume : 6
% 5.25/2.32 #Demod : 55
% 5.25/2.32 #Tautology : 59
% 5.25/2.32 #SimpNegUnit : 0
% 5.25/2.32 #BackRed : 0
% 5.25/2.32
% 5.25/2.32 #Partial instantiations: 0
% 5.25/2.32 #Strategies tried : 1
% 5.25/2.32
% 5.25/2.32 Timing (in seconds)
% 5.25/2.32 ----------------------
% 5.25/2.33 Preprocessing : 0.58
% 5.25/2.33 Parsing : 0.30
% 5.25/2.33 CNF conversion : 0.05
% 5.25/2.33 Main loop : 0.65
% 5.25/2.33 Inferencing : 0.23
% 5.25/2.33 Reduction : 0.18
% 5.25/2.33 Demodulation : 0.12
% 5.25/2.33 BG Simplification : 0.03
% 5.25/2.33 Subsumption : 0.15
% 5.25/2.33 Abstraction : 0.02
% 5.25/2.33 MUC search : 0.00
% 5.25/2.33 Cooper : 0.00
% 5.25/2.33 Total : 1.27
% 5.25/2.33 Index Insertion : 0.00
% 5.25/2.33 Index Deletion : 0.00
% 5.25/2.33 Index Matching : 0.00
% 5.25/2.33 BG Taut test : 0.00
%------------------------------------------------------------------------------