TSTP Solution File: SET767+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SET767+4 : TPTP v8.1.2. Released v2.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 : n018.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:56:59 EDT 2023
% Result : Theorem 26.37s 12.84s
% Output : CNFRefutation 26.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 44
% Syntax : Number of formulae : 51 ( 3 unt; 41 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 4 ~; 4 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 37 >; 36 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 33 ( 33 usr; 4 con; 0-3 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > subset > pre_order > partition > member > equivalence > equal_set > disjoint > equivalence_class > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_11 > #skF_6 > #skF_17 > #skF_20 > #skF_3 > #skF_13 > #skF_14 > #skF_12 > #skF_18 > #skF_19 > #skF_8 > #skF_21 > #skF_22 > #skF_2 > #skF_23 > #skF_7 > #skF_1 > #skF_16 > #skF_9 > #skF_5 > #skF_15 > #skF_4 > #skF_10
%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(power_set,type,
power_set: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(product,type,
product: $i > $i ).
tff(apply,type,
apply: ( $i * $i * $i ) > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff(partition,type,
partition: ( $i * $i ) > $o ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(equivalence,type,
equivalence: ( $i * $i ) > $o ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_21',type,
'#skF_21': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(pre_order,type,
pre_order: ( $i * $i ) > $o ).
tff('#skF_22',type,
'#skF_22': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff(equivalence_class,type,
equivalence_class: ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_208,axiom,
! [R,E,A,X] :
( member(X,equivalence_class(A,E,R))
<=> ( member(X,E)
& apply(R,A,X) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+2.ax',equivalence_class) ).
tff(f_235,negated_conjecture,
~ ! [E,R,A] :
( equivalence(R,E)
=> subset(equivalence_class(A,E,R),E) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII03) ).
tff(c_6,plain,
! [A_1,B_2] :
( member('#skF_1'(A_1,B_2),A_1)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_802,plain,
! [X_209,E_210,A_211,R_212] :
( member(X_209,E_210)
| ~ member(X_209,equivalence_class(A_211,E_210,R_212)) ),
inference(cnfTransformation,[status(thm)],[f_208]) ).
tff(c_53575,plain,
! [A_1705,E_1706,R_1707,B_1708] :
( member('#skF_1'(equivalence_class(A_1705,E_1706,R_1707),B_1708),E_1706)
| subset(equivalence_class(A_1705,E_1706,R_1707),B_1708) ),
inference(resolution,[status(thm)],[c_6,c_802]) ).
tff(c_4,plain,
! [A_1,B_2] :
( ~ member('#skF_1'(A_1,B_2),B_2)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_53889,plain,
! [A_1705,E_1706,R_1707] : subset(equivalence_class(A_1705,E_1706,R_1707),E_1706),
inference(resolution,[status(thm)],[c_53575,c_4]) ).
tff(c_250,plain,
~ subset(equivalence_class('#skF_23','#skF_21','#skF_22'),'#skF_21'),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_53900,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_53889,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET767+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.14 % 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.35 % Computer : n018.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:17:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 26.37/12.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.37/12.85
% 26.37/12.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 26.37/12.87
% 26.37/12.87 Inference rules
% 26.37/12.87 ----------------------
% 26.37/12.87 #Ref : 0
% 26.37/12.87 #Sup : 12432
% 26.37/12.87 #Fact : 0
% 26.37/12.87 #Define : 0
% 26.37/12.87 #Split : 1
% 26.37/12.87 #Chain : 0
% 26.37/12.87 #Close : 0
% 26.37/12.87
% 26.37/12.87 Ordering : KBO
% 26.37/12.87
% 26.37/12.87 Simplification rules
% 26.37/12.87 ----------------------
% 26.37/12.87 #Subsume : 1046
% 26.37/12.87 #Demod : 2213
% 26.37/12.87 #Tautology : 2213
% 26.37/12.87 #SimpNegUnit : 419
% 26.37/12.87 #BackRed : 9
% 26.37/12.87
% 26.37/12.87 #Partial instantiations: 0
% 26.37/12.87 #Strategies tried : 1
% 26.37/12.87
% 26.37/12.87 Timing (in seconds)
% 26.37/12.87 ----------------------
% 26.37/12.87 Preprocessing : 0.60
% 26.37/12.87 Parsing : 0.28
% 26.37/12.87 CNF conversion : 0.06
% 26.37/12.87 Main loop : 11.24
% 26.37/12.87 Inferencing : 1.82
% 26.37/12.87 Reduction : 5.14
% 26.37/12.87 Demodulation : 3.71
% 26.37/12.87 BG Simplification : 0.11
% 26.37/12.87 Subsumption : 3.39
% 26.37/12.87 Abstraction : 0.13
% 26.37/12.87 MUC search : 0.00
% 26.37/12.87 Cooper : 0.00
% 26.37/12.87 Total : 11.88
% 26.37/12.87 Index Insertion : 0.00
% 26.37/12.87 Index Deletion : 0.00
% 26.37/12.87 Index Matching : 0.00
% 26.37/12.87 BG Taut test : 0.00
%------------------------------------------------------------------------------